A divide and conquer recursive algorithm.
Quicksort is a commonly used sorting algorithm that has a best-case time complexity of O(n log n) and worst-case of O(n²). The worst-case happens when the array to be sorted is already sorted or nearly sorted.
Quicksort works by selecting an element in the array as the ‘pivot’ and then dividing the array into two partitions. One partition for values less than the pivot and one partition for those that a greater.
Today we will be looking at a quicksort implementation that handles the sorting of an array of integers but it can easily…
Jump search (block search) is an algorithm for finding an element in a sorted array in O(√n) time.
Jump search works by iterating over the input array in blocks of size √n and once an element’s value is larger than the target value it converts to a linear search of the current block which must contain the target value.
Next, we must consider our edge cases.