Timeline for two's complement finding algorithm
Current License: CC BY-SA 3.0
Post Revisions
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 28, 2011 at 13:39 | answer | added | Cheers and hth. - Alf | timeline score: 1 | |
| S Sep 28, 2011 at 13:34 | history | suggested | BenH | CC BY-SA 3.0 |
fixed grammar
|
| Sep 28, 2011 at 12:18 | vote | accept | Community Bot | moved from User.Id=466534 by developer User.Id=18937026 | |
| Sep 28, 2011 at 12:08 | review | Suggested edits | |||
| S Sep 28, 2011 at 13:34 | |||||
| Sep 28, 2011 at 12:02 | answer | added | Jurlie | timeline score: 1 | |
| Sep 28, 2011 at 11:58 | history | edited | user466534 | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Sep 28, 2011 at 11:54 | comment | added | ereOn |
Please put some effort in the formatting of your questions if you expect answers. I indented the code, removed some empty lines and added some spaces, because int k = m % 2; definitely reads better than int k=m%2;.
|
|
| Sep 28, 2011 at 11:53 | history | edited | ereOn | CC BY-SA 3.0 |
deleted 287 characters in body
|
| Sep 28, 2011 at 11:44 | comment | added | Fred Foo | Please indent your code properly, it's unreadable now. | |
| Sep 28, 2011 at 11:42 | history | asked | user466534 | CC BY-SA 3.0 |