Content deleted Content added
→mistakes and ArrayV: new section |
|||
Line 1,165:
::The DeepMind AI sorting algorithm targets sorting 3 to 5 elements and in the case of 5 elements, saves one compare. Not much of a breakthrough. [[User:Rcgldr|Rcgldr]] ([[User talk:Rcgldr|talk]]) 07:38, 24 July 2023 (UTC)
== mistakes and ArrayV ==
1 strength of ArrayV is, that the numbers, which are visualized as bars, are always integers, as I have never seen pigeonhole sort failing to sort an array.
There are some wrong time complexities in [[Sorting algorithm#Others]].
[[Pancake sorting|Simple pancake sort]] should be O(n) best and O(n<sup>2</sup>) average and worst and [[Bitonic sorter]] should be O(n log<sup>2</sup>n), best average and worst, where log<sup>2</sup>n means (log n)<sup>2</sup>. Well, these time complexities fit well to the results in https://www.youtube.com/watch?v=8MsTNqK3o_w&t=2825s and<nowiki/>https://www.youtube.com/watch?v=v4Uo0Pi6odo&t=15s. The fastest a sorting algorithm can reach is O(n). In [https://www.youtube.com/watch?v=FDeqdg5aDjY array v oof 2], [https://www.youtube.com/channel/UCbq_FsdbOH1xMUxJ44HDP8w sb] broke ArrayV by running parallel bitonic sort with 16384 numbers, but I think, it was just a freeze bug, like https://www.youtube.com/watch?v=vlLrmCifVRY&t=1646s.
Another strength of ArrayV is how the sorting algorithms are visualized. [https://www.youtube.com/channel/UCHHGwKj9BE_ax9-0dEdbcVA AceOfSpadesProduc100 himself] said in [https://www.youtube.com/watch?v=9u0siSrNlN0 (follow-up video) Threaded pattern-defeating merge sort on ArrayV-v4.0], in [https://www.youtube.com/watch?v=NjjvPpKZ_HM Parallel bitonic sort on ArrayV], in [https://www.youtube.com/watch?v=aLS88gBybe4 Parallel odd-even merge sort on ArrayV] and in [https://www.youtube.com/watch?v=VIAubQMTJW0 ArrayV-v4.0's parallel sorting algorithms], that he uses an Intel Core i7-9750H, which has 6 cores and 12 threads. But, the way ArrayV visualizes the sorting algorithms lets the parallel sorting algorithms do the fully parallel method. For example, [https://www.youtube.com/watch?v=NjjvPpKZ_HM parallel bitonic sort] could use [https://www.youtube.com/watch?v=zXHD5voNIQE&t=424s flan sort] [https://www.youtube.com/watch?v=TZJHMNJ8yag&t=20s rotations]. [[Special:Contributions/94.31.83.138|94.31.83.138]] ([[User talk:94.31.83.138|talk]]) 19:43, 23 August 2023 (UTC)
| |||