Tag Archives: BubbleSort

Progress and the Progressive

Progress means a ‘moving forward’, something ‘getting better or worse (!)’ as opposed to remaining in a state.

An illustration of the word progressive could be progressive algorithms, for example Bubble sort is progressive whereas Insertion sort isn’t. Bubble sort iterates through a list comparing the current item with the next item and swapping them if they are in the wrong order. After a half run, we have a list which is almost correctly sorted. Insertion sort removes all items to a temporary storage, picks one item and inserts it in its proper place. After a half run, we have a list with only half of its entries in it. That is, a half run of Insertion sort creates more corruption and of a more serious kind, than Bubble sort, when it is interrupted midway. For this reason many engineers and hackers like progressive algorithms because of their progressiveness, which is a good quality because an engineer, it is assumed, would produce code that accomplished constructive things for a user, a product or a project.
Continue reading