[Sorted Array]: We are given an array of non-negative integers A of size n. Within this...

 

Transcribed Image Text:

[Sorted Array]: We are given an array of non-negative integers A of size n. Within this array, the number of consecutive zeros between any two adjacent positive integers is at most two. If we remove all the zero elements from A, the resulting subarray is guaranteed to be in ascending order. [1,0,0,8,9,0,20] is a valid example for A when n = 7. (a) Given such array A and a nonzero element of A (referred to as x), our goal is to find the index within A where x is located. Write a pseudo code of an algorithm that achieves this task, following the same guidelines as in the first problem. (b) What is the time complexity of your algorithm? Justify your answer. [Sorted Array]: We are given an array of non-negative integers A of size n. Within this array, the number of consecutive zeros between any two adjacent positive integers is at most two. If we remove all the zero elements from A, the resulting subarray is guaranteed to be in ascending order. [1,0,0,8,9,0,20] is a valid example for A when n = 7. (a) Given such array A and a nonzero element of A (referred to as x), our goal is to find the index within A where x is located. Write a pseudo code of an algorithm that achieves this task, following the same guidelines as in the first problem. (b) What is the time complexity of your algorithm? Justify your answer.