This project focuses on search algorithms in C. It covers various search algorithms, including linear search, binary search, and more advanced search techniques. The project aims to provide a deep understanding of how these algorithms work and how to implement them efficiently.
- What is a search algorithm.
- What are linear search and binary search.
- What is the best search algorithm to use depending on the context.
- How to implement linear search and binary search.
- How to evaluate the time complexity of search algorithms.
| Task Name | File | Description |
|---|---|---|
| Linear search | 0-linear.c | Writes a function that searches for a value in an array of integers using the Linear search algorithm. |
| Binary search | 1-binary.c | Writes a function that searches for a value in a sorted array of integers using the Binary search algorithm. |
| Jump search | 100-jump.c | Writes a function that searches for a value in a sorted array of integers using the Jump search algorithm. |
| Interpolation search | 102-interpolation.c | Writes a function that searches for a value in a sorted array of integers using the Interpolation search algorithm. |
| Exponential search | 103-exponential.c | Writes a function that searches for a value in a sorted array of integers using the Exponential search algorithm. |
| Advanced binary search | 104-advanced_binary.c | Writes a function that searches for a value in a sorted array of integers using an advanced Binary search algorithm. |
| Jump search in a singly linked list | 105-jump_list.c | Writes a function that searches for a value in a sorted singly linked list using the Jump search algorithm. |
| Linear search in a skip list | 106-linear_skip.c | Writes a function that searches for a value in a sorted skip list using the Linear search algorithm. |