Design and Analysis of Algorithms20825 marksSearching Algorithms
State the time and space complexity for sequential search. Write the rules for master theorem for finding asymptotic bounds.
State the time and space complexity for sequential search. Write the rules for master theorem for finding asymptotic bounds. [5]
--- Sequential search (also called linear search) compares the search element with each element in the list one by one from the beginning. Case Condition Complexity ----------------------------- Best Case Element found at the first position O(1) Average Case Element found somewhere in the middle ...