1.An algorithm searches for both max and min values in an array of number s. The size of the array is N, and the numbers in the array are arranged randomly. 9.12 An algorithm searches for both max and...

1.An algorithm searches for both max and min values in an array of number s. The size of the array is
N,
and the numbers in the array are arranged randomly. 9.12 An algorithm searches for both max and min values in an array ofN numbers. The numbers in the array are arranged in sorted descending order. 2. An algorithm inserts numbers into a linked list such that the linked list will store the numbers in sorted ascending order. Originally, the list is empty, and the

algorithm inserts a total ofN numbers into the list. 9.15 Inserting each new value in the BST (finding location, insertion, balancing).