Talk:Sorting Algorithms/Circle Sort: Difference between revisions
Talk:Sorting Algorithms/Circle Sort (view source)
Revision as of 02:50, 14 January 2016
, 8 years agoWrong category
(→Complexity claim is wrong: new section) |
m (Wrong category) |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 2:
The complexity is said to be O(n log(n)) on the linked sourceforge page, which does not make sense. Each call to the <code>CircleSort</code> is O(n log(n)), but one call does not sort the array. It seems the sort routine needs to be called O(log(n)) times on average for a large random array. Maybe the number of swaps drops with each successive call due to the array becoming more ordered, but the number of comparisons is still the same, so the overall complexity is more like O(n log(n) log(n)). The runtime difference between this sorting method and quicksort becomes more significant as the array size increases. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 11:28, 7 January 2015 (UTC)
=== Isn't this a "Sorting Algorithm"? ===
Should this task not be called "Sorting Algorithms/Circle Sort" - even as a draft task? --[[User:Tim-brown|Tim-brown]] ([[User talk:Tim-brown|talk]]) 10:01, 14 January 2015 (UTC)
=== Wrong category ===
The category should be "Sorting_algorithms" (with lowercase "a").
| |||