Talk:Sorting algorithms/Bubble sort: Difference between revisions
Content added Content deleted
ReeceGoding (talk | contribs) |
(Undo revision 310316 by ReeceGoding (talk) This is not the place for comments.) |
||
| Line 165: | Line 165: | ||
The new code is very close to O(n<sup>2</sup>). The new bubble_sort() for CMake runs as fast as a bubble sort should run. --[[User:Kernigh|Kernigh]] 22:40, 24 September 2011 (UTC) |
The new code is very close to O(n<sup>2</sup>). The new bubble_sort() for CMake runs as fast as a bubble sort should run. --[[User:Kernigh|Kernigh]] 22:40, 24 September 2011 (UTC) |
||
== "The elements must have a total order and the index of the array can be of any discrete type. For languages where this is not possible, sort an array of integers." == |
|||
What exactly is this requirement? I thought that I had understood it, but when I've looked through some of the given solutions, it seems that many very powerful languages, such as every single language that has a name beginning with C, have only sorted an array of integers, implying that their language couldn't meet this requirement. Is there a misunderstanding somewhere? What examples was this requirement trying to encourage? --[[User:ReeceGoding|ReeceGoding]] ([[User talk:ReeceGoding|talk]]) 13:03, 2 August 2020 (UTC) |
|||