DSA using C Tutorial
Selected Reading
- DSA using C - Discussion
- DSA using C - Useful Resources
- DSA using C - Quick Guide
- DSA using C - Recursion
- DSA using C - Sorting techniques
- DSA using C - Search techniques
- DSA using C - Graph
- DSA using C - Heap
- DSA using C - Hash Table
- DSA using C - Tree
- DSA using C - Priority Queue
- DSA using C - Queue
- DSA using C - Parsing Expressions
- DSA using C - Stack
- DSA using C - Circular Linked List
- DSA using C - Doubly Linked List
- DSA using C - Linked List
- DSA using C - Array
- DSA using C - Concepts
- DSA using C - Algorithms
- DSA using C - Environment
- DSA using C - Overview
- DSA using C - Home
Selected Reading
- Who is Who
- Computer Glossary
- HR Interview Questions
- Effective Resume Writing
- Questions and Answers
- UPSC IAS Exams Notes
DSA using C - Search techniques
DSA using C - Search Techniques
Search refers to locating a desired element of specified properties in a collection of items. We are going to start our discussion using following commonly used and simple search algorithms.
| Sr.No | Technique & Description |
|---|---|
| 1 |
Linear search searches all items and its worst execution time is n where n is the number of items. |
| 2 |
Binary search requires items to be in sorted order but its worst execution time is constant and is much faster than pnear search. |
| 3 |
Interpolation search requires items to be in sorted order but its worst execution time is O(n) where n is the number of items and it is much faster than pnear search. |