See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 cards from this deck
Algorithm to find position of target value in a list by checking elements sequentially
Sequentially checks each element until found or end reached
Both sorted and unsorted datasets
O(1)O(1)O(1) when target is first element
O(n)O(n)O(n) when target is last or not present
O(n)O(n)O(n)
O(1)O(1)O(1), no extra memory required
-1
Index or position of the element
Simple and easy to implement
Inefficient for large datasets
Using print instead of return in function
Select your subjects, and get access to A+ resources today.