Arrays are a good way to dip your toe in the study of algorithms. They are not as complex as Trees or graphs and can serve a smooth bridge into more complex alogrithms.
Merge Sort is probably one of the best sorting algorithms. It works by repeatedly dividing an array into smaller parts and combining the results. It keeps dividing the array until the array size
Finding the smallest number in an array could be as simple as sorting the array and taking the number at the first index. But would be a very inefficient way doing it. A
Selection sort is probably the simplest sorting algorithm (for the programmer not the computer). The selection sort algorithm stays true to it's name and works by finding the given array's minimum (or maximum
Suppose that we have a sorted array haystack, with length N and a needle. Let's also suppose that the array is sorted in a non decreasing order. Binary search works by checking the