The linear search algorithm inspects each element in an array for a key. In the worst case,
the algorithm can check all elements in a list. The time complexity:
O(N)
Loading bar chart…
Weekly activity showing 20 bars for events.
Values: index 0: 41.0, index 1: 18.0, index 2: 76.0, index 3: 40.0, index 4: 95.0, index 5: 61.0, index 6: 58.0, index 7: 97.0, index 8: 57.0, index 9: 73.0, index 10: 98.0, index 11: 33.0, index 12: 77.0, index 13: 5.0, index 14: 71.0, index 15: 21.0, index 16: 68.0, index 17: 3.0, index 18: 38.0, and index 19: 74.0.