Skip to main content

Searching different types for Data Structure

We study here different types of searching like linear search and binary search applied on linear data structure, lists (array and linked list).

Linear search:
In this type search each and every element of the data structure (array or linked list) is compared with the key element till either the element is found or the list is over. The linear searching technique is used when there is no availability of direct address of the elements. Even though the address of the element is directly available, the application of linear search also depends on the order of elements stored in a list. So linear search can be applied either to one-dimensional array where the elements are not necessarily arranged in any order (although the address of any element is available directly) or to linked list where the address of any element is directly not available (although the elements may be ordered).
 
Binary search:
    In this type of search the elements in the list must be arranged in an order and the address of any element must be available directly. The direct availability of any element ’s address is only possible in case of one dimensional array can be arranged in order. So the binary search can only be applied to one dimensional array. In case of linked list binary search can not be applied because, even the elements may be arranged in an order, but the address of any element is not available directly.

Linear search applied to one dimensional array:
           Understanding and implementation of linear search to single or one dimensional array is simple. In any one-dimensional array the key to be searched is simply compared with all the elements of the array one by one till the last element. In between if the search is successful means if the key is equal to one of the elements then stop the comparison and return success. When comparison of the key with all the elements is over then return non-success. Usually when searching is applied to the list we assume that the elements are unique. So to apply linear search the elements of the array may not necessarily be in ascending or descending order. Remember that even though every element’s address is directly available, the linear search always performs comparison of key with the first element only and runs till the last element.

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …