Types Of Sorting - created from Mind Map

Page 1

Bubble Sort

Insertion Sort

Merge Sort

Sorts an unordered list

It compares each item whit the next one and swaps them if that are out of order

The algorithm finishes when no more swaps need to be made

In effect it "bubbles" up the largest (or smallest) item to the end of the list in successive passes.

This is the most inefficient of the sorting algorithms but is very easy to implement. This makes it a popular choice for very small data sets.

The insertion sort inserts each item into its correct position in a data set one at a time

It is a useful algorithm for small data sets.

It is particularly useful for inserting items into an already sorted list.

It is usually replaced by more efficient sorting algorithms for large data sets.

A very efficient method of performing a sort.

Uses a divide and conquer method. Creates two or more identical subproblems from the largest problem, solving them individually.

Combines their solutions to solve the bigger program

Data set is repeatedly split in half until each item is in its own list.

Adjacent lists are then merged back together Works very well for large data sets.