Learn how to implement popular data structures and algorithms in our next Python project with hands-on examples.

Python for Programmers

Data structures and algorithms are among the most fundamental concepts of computer science. This module is a detailed review of some of the most common data structures and algorithms, such as stack, linked lists, doubly linked lists, binary trees, binary search trees, and so on. With implementation details, thorough explanations, and hands-on coding exercises, we’ll gain the confidence to solve any problem related to our project.

Data Structures and Algorithms in Python

Binary search is only applicable in case of sorted lists. 

Binary search is only applicable in case of sorted lists.

What is the worst-case time complexity of the recursive approach of a binary search? 

What is the worst-case time complexity of the recursive approach of a binary search?

What is the worst-case time complexity of the iterative approach of a binary search? 

What is the worst-case time complexity of the iterative approach of a binary search?

Binary search works by comparing the target element with the values on the first and the last index of a list.

Binary search works by comparing the target element with the values on the first and the last index of a list.

What is the output of the following code?

```python
def binary_search_recursive(data, target, low, high):
 if low > high:
 	return False
 else:
 mid = (low + high) // 2
 if target < data[mid]:
 	return binary_search_recursive(data, target, low, mid-1)
 else:
 	return binary_search_recursive(data, target, mid+1, high)
data = [2,4,5,7,8,9]
target = 2
print(binary_search_recursive(data, target, 0, 5))

```

What is the output of the following code?
<pre><code class="language-python">def binary_search_recursive(data, target, low, high):
 if low &gt; high:
 	return False
 else:
 mid = (low + high) // 2
 if target &lt; data[mid]:
 	return binary_search_recursive(data, target, low, mid-1)
 else:
 	return binary_search_recursive(data, target, mid+1, high)
data = [2,4,5,7,8,9]
target = 2
print(binary_search_recursive(data, target, 0, 5))

</code></pre>

It's quiz time! Test yourself by solving these questions about binary search. 

Built-in Data Structures

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Conclusion

Quiz