New answers tagged

0

Well searching an element in the array sequentially has a time complexity of O(n) in the worst case scenario because you imagine traversing through the whole list to get an element at the end or to find out the element you are searching for does not exist. O(n) is because the operation of searching grows linearly as the array size grow. In the worst case for ...


Top 50 recent answers are included