This course teaches various searching algorithms in Python, including Binary Search, finding closest numbers, fixed points, bitonic peaks, first entries in lists with duplicates, using Python's Bisect method, integer square roots, and searching in cyclically shifted arrays. The course aims to help learners understand and implement these algorithms efficiently. The teaching method involves practical coding examples and explanations. This course is suitable for individuals interested in improving their algorithmic problem-solving skills in Python.
Overview
Syllabus
Algorithms in Python: Binary Search.
Binary Search in Python: Find Closest Number.
Binary Search in Python: Find Fixed Point.
Binary Search in Python: Find Bitonic Peak.
Binary Search in Python: Find First Entry in List with Duplicates.
Binary Search in Python: Python's Bisect Method.
Binary Search in Python: Integer Square Root.
Binary Search in Python: Cyclically Shifted Array.
Taught by
Lucid programming
