Using all the learned tools, for each

problem below try to write $2$ algorithm

Functions to solve and after that

compute the big O complexity $($ time $,$

space $)$ for each solution and choose the

better one :

Find the Missing Number in an Array

Problem: Given an array

containing distinct numbers

taken from the range to $,$

write an algorithm to find the

missing number.

Example Input:

Example Output:

Find the Kth Largest Element

Problem: Write a function to find

the th largest element in an

unsorted array. Note that it is the

th largest element in sorted

order, not the th distinct

element

Example Input: $,$

Example Output: