(Short answer Questions)

5. [5 marks] Briefly describe an algorithm for removing duplicates from an array Analyze the time complexity (Big-Oh) of the algorithm 6. [5 marks] Briefly describe an algorithm for finding the max element in an array Analyze the time complexity (Big-Oh) of the algorithm. 7. [5 marks] Put the following growth functions in order: O(n log n), Olog n), ), 0(2") O), O(n3), O(n2) 15 mark) Pur the following growih finctionsi ore n3 5000 100logn,10nlogn, 10000,2n2 10000.5n 71