Sorting Algorithms

moving through a list repeatedly, swapping elements that are in the wrong order

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

uses two lists, one for sorted elements and one for unsorted elements.

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

Splits a list into individual elements, joining together in multiples of 2 until one sorted list is left

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

One item at a time / serially … …moved into correct position… …until all items in list checked

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

•Has a consistent running time, regardless of how the items are ordered in the original list

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

•Is regarded as one of the best sorting algorithms

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

Most complicated algorithm to program

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

Take each item in turn, compare to the items in the sorted list and place it.<br />

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

Which sorting algorithm needs to go through the list repeatedly?<br />

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort