Category: inefficient

Inefficient

Bubble sort
Categories:  Sort   Inefficient  

Adjacent elements are swapped until list is sorted

Try it out!
Binary search
Categories:  Search   Inefficient  

Splits sorted data set in half until target is (not) found

Try it out!
Insert sort
Categories:  Sort   Inefficient  

Goes over unsorted part of the array and inserts each next element into its sorted position in the sorted part

Try it out!
Count sort
Categories:  Sort   Efficient   Inefficient  

Counts number of occurences of each number, saves it, prints the occurences by going thorugh the count array

Try it out!
Linear search
Categories:  Search   Inefficient  

Goes over the whole array, index by index, looking for the target value

Try it out!