Question
PART B Provide the time complexity analysis for the given algorithm. Use Big-O notation and explain your reasoning. (a) def find_max(arr): max_element = arr[0] for element in arr: if element > max_element: max_element = element return max_element
Question image 1