Please enable JavaScript.
Coggle requires JavaScript to display documents.
Computing - unit 1 - Coggle Diagram
Computing - unit 1
Sorting algorithms
Bubble sort
-
-
-
-
when the program has gone through all the terms in the list once, it is called an iteration, or pass
Merge sort
-
-
-
-
much more efficient than bubble sort, and works well with large data sets
when single lists are combined, you must compare adjacent lists with each other, when each list is in a pair
-
Insertion sort
-
-
-
-
you must first insert the first item into a new list, then follow it up with the rest of the items, comparing each one to the newly sorted list
-
-
Searches
Linear search
-
Go through the list repeatedly, comparing each term
-
-
Binary search
-
-
if the term is greater than the midpoint, you disregard values on the left hand side and just look at the right to calculate the next midpoint
if the term is less than the midpoint, you would disregard the terms on the right hand side and calculate the midpoint of the left hand values
-
-
computational thinking
-
decomposition
breaking down the problem into simple, manageable chunks
-