python:11 Describe an efficient recursive function for solving the element uniqueness problem, which runs in time that is at most O(n 2 ) in the...

python:

C-4.11 Describe an efficient recursive function for solving the element uniqueness

problem, which runs in time that is at most O(n2) in the worst case

without using sorting.

C-3.35 Assuming it is possible to sort n numbers in O(nlog n) time, show that it

is possible to solve the three-way set disjointness problem in O(nlogn)

time.

C-3.49 Consider the Fibonacci function, F(n) (see Proposition 3.20). Show by

induction that F(n) is Ω((3/2)n).