EFFICIENCY EVALUATION OF SEARCHING TECHNIQUES FOR DATA RETRIEVAL

Searching is an important operation in data structures for efficient data retrieval. The choice of searching algorithm has a direct impact on the performance of a computer program, particularly when working with large datasets. Linear Search is simple, flexible, and suitable for small or unsorted datasets. However, its O(n) worst-case complexity makes it less efficient as the dataset becomes very large. Binary Search provides much faster searching with a O(log n) worst-case complexity, but it requires the data to be sorted. For large datasets that are already sorted or require frequent searches, Binary Search is generally the more efficient choice. Therefore, there is no single searching algorithm that is ideal for every situation. The appropriate technique depends on factors as data size, organization, hardware configurations, programming language, memory access, and sorting is required can influence actual execution time.

[1]    Gilberg and Forouzan, “Data Structure-A pseudocode approach with C”, 2nd Edition, 2005, Cengage Learning [2]    Schaum Lipschutz, “Data Structures with C”, Schaums’ Outlines Series, Indian Edition, 2nd Edition, 2017, Tata McGraw Hill. [3]    E Balagurusamy, “Data Structures Using C”, 1st Edition, 2017, Tata McGraw Hill [4]    Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, “Fundamentals of Data Structures in C”, 2nd Edition, 2018, W.H. Freeman and Company [5]    R. S. Salaria, “Data Structures and Algorithms using C”, 2nd Edition, 2022, Khanna Publishing [6]    Yashavant Kanetkar, “Data Structures Through C”, 4th Edition, 2022, BPB publication