Bubble sort: Works in separate stages called 'passes' , Works through a list and swaps pair at a time, Is the least efficient sort (usually), Merge sort: Highly efficient sorting algorithm, divide and conquer, List is repeatedly divided in two until all items are separate, Elements then compared and placed back together in order, Insertion sort: Less efficient than merge, but more than bubble, Compares values in turn starting with the second item in the list, Value is repeatedly moved to the left 'sorted' side until it meets a value that is less than itself, Binary search: Most efficient method of searching a list, Can only be used on an ordered list, Counter starts at midpoint, list is divided and sections ignored depending on value, For an even number list, it's best to round up to get the midpoint - just make sure you stay consistent with rounding up or down, Linear search: Simplest method of searching a data set, Starts at the beginning of a list, each item is checked until a match is found, Very inefficient searching algorithm,

Searching and sorting algorithms

Cetak
Menyematkan

Papan Peringkat

Gaya visual

Pilihan

Berganti templat

Pulihkan simpan otomatis: ?