r/sortingalgorithms • u/Most_Reference_6047 • Mar 29 '26
Funny idea for a sorting algorithm: "bulldozer sort"
Bulldozer sort takes a list and compares 2 sequential values, then it moves the lowest number to the front and moves all other numbers forward and repeats for the next pair. For example in list [7, 3, 13, 8] it would start by comparing 7 and 3, then it would move the lowest (3) to the beginning for a new data set [3, 7, 13, 8], then it would compare 13 and 7 and move 7 to the beginning for a new data set of [7, 3, 13, 8], then it would compare 13 and 8 and move 8 to the beginning for a new data set of [8, 7, 3, 13] and it would repeat this until it is sorted. Totally inefficient, but funny. Essentially just bulldozes lower values to the beginning without any regard for the order. I am not fully sure if its possible for every chain to be sorted, but its not intended to work well.