- Linear searching algorithm sequentially checks each element in a list until the target element is found.
- Linear searching is suitable for small lists or unsorted data.
- Time complexity of linear searching is O(n).
- Binary searching algorithm requires a sorted list.
- Binary searching algorithm divides the list in half at each step and compares the target element with the middle element to determine if it lies in the first or second half of the list.
- Time complexity of binary searching algorithms is O(log n).
Python Programming
-
- 8-1. Why Functions?
- 8-2. The Syntax of Function Definition
- 8-3. Void Functions and Value Returning Functions
- 8-4. Function Arguments and Parameters
- 8-5. The if __name__ == "__main__": Statement
- 8-6. The yield Statement
- 8-7. Nesting Function Calls
- 8-8. Calling from the Call
- Summary
- Programming Exercises
Summary
Last updated: April 23, 2025