Content deleted Content added
Line 1,177:
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)
== corrections for "Explaining EVERY Sorting Algorithm" parts ==
'''bold''' = correction
part 2: https://www.youtube.com/watch?v=wqibJMG42Ik
patience sort: O(n) best, O(n log n) average and worst, O(n) memory, '''stable'''
tournament sort: O(n log n) best, average and worst, O(n) memory, '''stable'''
bitonic sort: '''O(n log^2 n) best, average''' and worst, O(1) memory, unstable
odd-even merge sort: '''O(n log^2 n) best, average''' and worst, O(1) memory, unstable
pairwise sorting network: '''O(n log^2 n) best, average''' and worst, O(1) memory, unstable
stooge sort: O(n^2.71) best average and worst, '''O(1) memory''', unstable
slow sort: O(n^(log n)) best average and worst, '''O(1) memory''', unstable
variants and hybrids: https://www.youtube.com/watch?v=FntVy6lPVyo
cartesian tree sort: O(n log n) best, average and worst, O(n) memory, '''stable'''
Stalin sort: O(n) best, average and worst, O(1) memory, '''stable'''
sleep sort: O(n) best, O(n + r) average and worst, O(n) memory, '''stable'''
miracle sort: O(n) best (on a sorted list), O(inf) average and worst, O(1) memory, '''stable'''
power sort: O(n * n!) best, average and worst, O(n * n!) memory, '''stable'''
A sorting algorithm can not be faster than O(n).
Stalin sort increases unsorted values to the largest previously read value (https://www.youtube.com/watch?v=hyOlWQ9MLPI). For example, [1, 2, 5, 3, 6, 4, 10] becomes [1, 2, 5, 5, 6, 6, 10].
Sleep sort is a time-based sorting algorithm. The smallest number wakes up first and the largest number wakes up last (https://www.youtube.com/watch?v=ktgxMtWMflU&t=210s). Equal numbers will wake up at the same time, but waking up is swapless.
Miracle sort only makes comparisons and power sort prints all the permutations in auxiliary arrays, so both of them are swapless.
Swaps of non-adjacent numbers are what makes a sorting algorithm unstable (https://www.youtube.com/watch?v=KJuxI1BBLyQ&t=403s).
some examples
cycle sort, bitonic sort, odd-even merge sort, pairwise sorting network, stooge sort and slow sort: Swap non-adjacent numbers. = unstable
insertion sort and binary insertion sort: Swap only adjacent numbers. = stable
patience sort, tournament sort, cartesian tree sort, Stalin sort, sleep sort, miracle sort and power sort: no swaps = stable [[Special:Contributions/94.31.89.138|94.31.89.138]] ([[User talk:94.31.89.138|talk]]) 20:28, 28 October 2023 (UTC)
| |||