notes:discrete:fall2021:projects:saf2
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| notes:discrete:fall2021:projects:saf2 [2021/10/21 03:14] – Added element limit recommendation to Slow Sort algorithm smalik3 | notes:discrete:fall2021:projects:saf2 [2021/10/21 03:16] (current) – Added direct link to References in Slow Sort algorithm conclusion smalik3 | ||
|---|---|---|---|
| Line 100: | Line 100: | ||
| It then does a comparison of values, seeing if the element at the middle index of the array is greater than the element at the ending index of the array. If this condition turns out true then both elements are swapped. After this, we do one last sort... and this one is the kicker. Now we will recursive call our Slow Sort algorithm with the same table, same initial index, and the ending index minus one. | It then does a comparison of values, seeing if the element at the middle index of the array is greater than the element at the ending index of the array. If this condition turns out true then both elements are swapped. After this, we do one last sort... and this one is the kicker. Now we will recursive call our Slow Sort algorithm with the same table, same initial index, and the ending index minus one. | ||
| - | The combination of all these recursive calls and minor swaps is what results in the extremely slow speeds of this algorithm. For more information check out the paper written on this algorithm in References below. | + | The combination of all these recursive calls and minor swaps is what results in the extremely slow speeds of this algorithm. For more information check out the paper written on this algorithm in [[https:// |
| ====Display==== | ====Display==== | ||
notes/discrete/fall2021/projects/saf2.1634786048.txt.gz · Last modified: 2021/10/21 03:14 by smalik3
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
