Searching Algorithm

4 flashcards · Other · by nitro support

1. Why we need searching algorithms ?

   Searching is the process of finding a element/file among piles of file /element. To perform that task efficiently we need a step wise procedure ,and that systematic procedure is called as algorithm. Wiki Answer Any algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain, either with discrete or continuous values.

2. What are classification of algorithms?

   Searching algorithms are classified as Sequential Interval

3. What are Types of Searching Algorithms

   Linear Search Binary Search Jump Search Interpolation Search Exponential Search Sub list Search (Search a linked list in another list) Fibonacci Search The Ubiquitous Binary Search

4. Explain Linear Search with its time complexity?

   A simple approach is to do linear search, i.e Start from the leftmost element of arr[] and one by one compare x with each element of arr[] If x matches with an element, return the index. If x doesn’t match with any of elements, return -1. Time complexity : O(n)