Timeline for My own algorithm to sort integers
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11, 2018 at 12:24 | comment | added | Deepan |
yes programmatically it is not needed, but if we were to omit that computationally it will go to for loop and create k and then assign 0 to k and then compare k<v[i] which would increase the computational overhead by a small margin.
|
|
| Dec 11, 2018 at 10:11 | comment | added | chux |
Simplification: if (v3[i] != 0) not needed.
|
|
| Dec 8, 2018 at 20:53 | comment | added | Alex | counting sort is just what I wanted to do. I did not know It. I just tried to make a more efficient algorithm of the Bubble Sort | |
| Dec 8, 2018 at 20:15 | comment | added | Deepan | Like @Yurim said in the comments on the question, It is called the Counting Sort here's wiki page for the explanation | |
| Dec 8, 2018 at 19:39 | vote | accept | Alex | ||
| Dec 8, 2018 at 18:16 | comment | added | greybeard |
(Welcome to Code Review!) I especially like the Note:s. Do you happen to know a name that could be/is given to this sorting method? Do you have remarks/advice about how it is coded?
|
|
| Dec 8, 2018 at 18:10 | history | edited | Deepan | CC BY-SA 4.0 |
deleted 104 characters in body
|
| Dec 8, 2018 at 18:05 | review | First posts | |||
| Dec 8, 2018 at 18:16 | |||||
| Dec 8, 2018 at 18:01 | history | answered | Deepan | CC BY-SA 4.0 |