Coding sorting algorithms

Computing

Algorithms

'A more efficient version of bubble sort uses a variable to flag when a swap was made during a single pass'

'The insertion sort algorithm copies the value to be inserted in a variable at the end of each pass'

'During a pass of an insertion sort, elements in the sorted part of the list are copied into the next position, to make space for the value to be inserted'

Two improvements to the bubble sort algorithm are reducing the number of comparisons after each pass, and stopping once no swaps are made during a single pass.

"Bubble sort compares items next to each other in the list and swaps them if they are in the wrong order."

"Insertion sort compares an item from the unsorted sublist with the items in the sorted sublist and places it in the correct position."

"Bubble sort is good at sorting large collections of unordered data."

"Bubble sort can be really fast at sorting data that is nearly in order."

"Insertion sort is usually slower to execute than bubble sort on large, unordered data sets."

"The insertion sort algorithm works by grouping the items in a list into two parts: a sorted sublist and an unsorted sublist."

"With each pass through the list, an item from the unsorted sublist is compared to items in the sorted sublist until it is inserted into the correct position."

"If the item at the current position is greater than value, copy it into the next item and move on to the previous item in the list"

"During a pass of an insertion sort, elements in the sorted part of the list are copied into the next position, to make space for the value to be inserted."

This lesson will soon be taken down.

Coding sorting algorithms

Lesson outcome