Timeline for Selecting kids for a Christmas play with similar heights
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2017 at 10:45 | comment | added | Suraj Jain | I am there now. | |
| Feb 11, 2017 at 10:28 | comment | added | JS1 | @SurajJain Ok, here is a chat room | |
| Feb 11, 2017 at 8:22 | comment | added | Suraj Jain | Can We Chat? I have to ask some things. | |
| Feb 9, 2017 at 11:13 | history | edited | JS1 | CC BY-SA 3.0 |
added 302 characters in body
|
| Feb 9, 2017 at 10:56 | history | edited | JS1 | CC BY-SA 3.0 |
added 1162 characters in body
|
| Feb 9, 2017 at 10:36 | history | bounty ended | Suraj Jain | ||
| Feb 9, 2017 at 10:36 | comment | added | Suraj Jain | And Sir , i will talk with you , now i have to go to library , i will learn this radix sort , and other things and i am confused about buffer input and some things , and will ask all this later from you. I am awarding you bounty. Congratulations | |
| Feb 9, 2017 at 10:34 | comment | added | Suraj Jain | See This stackoverflow.com/a/41332552/5473170 , this is the thing | |
| Feb 9, 2017 at 10:34 | history | edited | JS1 | CC BY-SA 3.0 |
added 2 characters in body
|
| Feb 9, 2017 at 10:33 | comment | added | JS1 | @SurajJain Well I don't agree with that answer regarding radix sort. It should be faster than quicksort for integers. But it isn't a universal sort because it relies on data types that can be split into digits. Whereas quicksort can be used for any type that can be compared. | |
| Feb 9, 2017 at 10:31 | vote | accept | Suraj Jain | ||
| Feb 9, 2017 at 10:29 | comment | added | Suraj Jain | And See This softwareengineering.stackexchange.com/questions/77529/… , this is one of the reason i thought quick sort is best , i have never heard of radix sort , so i will learn it first, | |
| S Feb 9, 2017 at 10:29 | history | suggested | Suraj Jain | CC BY-SA 3.0 |
edited it to be more readable , radix sort in bold was not good , `i` was not looking good. and added link to spoj ranks
|
| Feb 9, 2017 at 10:27 | comment | added | Suraj Jain | Can we chat, some hours later , till then i will prepare list of things i am confused about , and learn a little more about radix sort ? , also i edited your answer , to link to spoj rank where your name is there with time 0.00 | |
| Feb 9, 2017 at 10:25 | comment | added | JS1 |
@SurajJain I'm not sure why you think radix sort would be slower than std::sort? Radix sort is not a comparison sort, and should be faster than comparison sorts such as quicksort. If you just run my radix sort against std::sort for large integer arrays, you will see that it is much faster (as it should be).
|
|
| Feb 9, 2017 at 10:25 | review | Suggested edits | |||
| S Feb 9, 2017 at 10:29 | |||||
| Feb 9, 2017 at 10:22 | comment | added | Suraj Jain | How can radix sort be faster , i did std:sort with getchar_unlocked earlier and got 0.02 , how is that radix sort is faster , also i need to chat with you, can we? | |
| Feb 9, 2017 at 10:17 | history | answered | JS1 | CC BY-SA 3.0 |