sorting algorithms
debates?
non-existent because of the very nature of proving algorithms and how they are accepted by the scientific community
mostly focused on how efficient the run-time of the algorithms are, rather than if they are accepted as theory
types
Radix
1904
bubble
first documented: 1956
mergesort
1945
binary in nature
published 1946, dates back to 200BC
John von Neumann
use substitution processes in order to prove recurrence
quicksort
n^2
origin
Mohammed ibn-Musa al-Khwarizmi, who was part of the royal court in Baghdad and who lived from about 780 to 850
disproving
counterexamples automatically debunk algorithms
acceptability?
mathematicians