Timeline for Insertion vs Selection
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2012 at 0:17 | answer | added | palacsint | timeline score: 1 | |
| Oct 17, 2012 at 23:38 | answer | added | supercat | timeline score: 1 | |
| Aug 30, 2012 at 4:51 | review | Close votes | |||
| Sep 7, 2012 at 3:02 | |||||
| Jun 1, 2012 at 3:24 | history | edited | Jesse C. Slicer |
added homework tag
|
|
| May 23, 2012 at 8:15 | history | tweeted | twitter.com/#!/StackCodeReview/status/205210328370388992 | ||
| May 19, 2012 at 4:43 | answer | added | pippin1289 | timeline score: 1 | |
| May 18, 2012 at 14:46 | comment | added | user1051043 | I am sorting a poker hand from smallest rank to largest, and if the deck is < 5 then inserting a new card, and sorting as needed. I am aware of a few sorting implementation but this is for a class project, and we are not allowed to use any of them. | |
| May 18, 2012 at 12:49 | answer | added | user1051043 | timeline score: 1 | |
| May 18, 2012 at 10:37 | comment | added | Konrad Rudolph |
While it’s true that insertion sort is generally faster, both algorithms are inefficient except on almost-sorted or very small input. I’d therefore like to ask what your use-case is. Maybe another algorithm would be altogether more appropriate. Furthermore, are you aware that Java provides an extremely efficient Arrays.sort implementation?
|
|
| May 18, 2012 at 3:18 | history | asked | user1051043 | CC BY-SA 3.0 |