<Tr> <Th> Delete </Th> <Td> </Td> <Td> O (n) </Td> <Td> O (n) </Td> </Tr> <P> A sorted array is an array data structure in which each element is sorted in numerical, alphabetical, or some other order, and placed at equally spaced addresses in computer memory . It is typically used in computer science to implement static lookup tables to hold multiple values which have the same data type . Sorting an array is useful in organising data in ordered form and recovering them rapidly . </P> <P> There are many well - known methods by which an array can be sorted, which include, but are not limited to: Selection sort, Bubble sort, Insertion sort, Merge sort, Quicksort, Heapsort, and Counting sort . These sorting techniques have different algorithms associated with them, and there are therefore different advantages to using each method . </P> <P> Sorted arrays are the most space - efficient data structure with the best locality of reference for sequentially stored data . </P>

What is the time complexity for searching for a number in a sorted array