Timeline for My own algorithm to sort integers
Current License: CC BY-SA 4.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 12, 2019 at 15:10 | comment | added | chux |
Minor idea: max - min + 1 can overflow int math leading to UB. A better behaved alternative: 1LU + max - min or even better (size_t)1 + max - min .
|
|
Mar 12, 2019 at 7:54 | history | edited | klutt | CC BY-SA 4.0 |
added 20 characters in body
|
Mar 12, 2019 at 7:25 | history | edited | klutt | CC BY-SA 4.0 |
added 10 characters in body
|
Mar 12, 2019 at 6:58 | history | edited | klutt | CC BY-SA 4.0 |
added 54 characters in body
|
Mar 12, 2019 at 6:53 | comment | added | klutt | @chux Very late, but I fixed the problem with length == 0 and overflow problem. | |
Mar 12, 2019 at 6:52 | history | edited | klutt | CC BY-SA 4.0 |
added 12 characters in body
|
Dec 11, 2018 at 14:35 | comment | added | klutt | @greybeard Thank you. I named it list at first, but later changed it to array. | |
Dec 11, 2018 at 14:35 | history | edited | klutt | CC BY-SA 4.0 |
added 1 character in body
|
Dec 11, 2018 at 11:01 | history | edited | klutt | CC BY-SA 4.0 |
added 1 character in body
|
Dec 10, 2018 at 9:04 | comment | added | greybeard |
The one thing I'd do differently (apart from formatting) would be for (int j = tmp[i] ; 0 <= --j ; ) array[++index] = i + min; .
|
|
Dec 10, 2018 at 7:59 | history | edited | klutt | CC BY-SA 4.0 |
edited body
|
Dec 10, 2018 at 0:04 | history | answered | klutt | CC BY-SA 4.0 |