The following list of numbers is the return value of a partitioning algorithm (Lomuto's or Hoare's, e.g.). Circle all possible valid pivots (the values the arrays were partitioned with). 2 1 3 5 4 10 8 14

You are given an array in which every number from 1 to N appears precisely once with the exception of one. How is the missing number to be located in O(N) time and 0(1) space? What if two numbers were absent?

Write an algorithm to sort elements in an array with selection sort in pseudocode. You will be given an array, and you need to sort the elements in ascending order. ps: Some things to keep in mind: sorting is not required if the given array has a length of 0 or 1. You should take care to ensure that you start with the smallest element, and swap it to the front of the array. From there, compare each successive element with all previous elements and place them correctly, repeating the process until it's all sorted. ======================================================================================= Write an algorithm to sort elements in an array with insertion sort in pseudocode. You will be given an array, and you need to sort the elements in ascending order. ======================================================================================= Write an algorithm to sort elements in an array with merge sort in pseudocode. You will be given an array, and you need to sort the elements…

Quicksort SPLIT (the 2-pointer algorithm covered in class) is applied to the integer array [4,3,5,7,9,2,1], using the first entry as the pivot.  Show the series of item swaps that are performed in the split process, and the array after each of these swaps, up to and including the step of placing the pivot at its correct location. You only need to show the split of the original array, you are not required to continue working on the subarrays after the split.