2.1.1 Algorithm for Linear Search
Procedure Linear_Search (A[1…n] , item) //item= required element.
{ For ( i=0 ; i<=n ; i++)
{ if ( A[i] == item) return i; break; } //end if
}//end loop
//end Procedure [4]
2.2 Binary search tree
Binary search tree is also known as half-interval search or binary chop. [6]
Increasing the information leads to increase the speed of searching operations and more effective so the data must be ordered therefore this search algorithm searches only in a sorted array by finding the index of the position of the required element. [7]
The work principle of the binary search tree is that each time the middle is determined by the lower and higher elements then make a comparison between the middle and the required element
Procedure Linear_Search (A[1…n] , item) //item= required element.
{ For ( i=0 ; i<=n ; i++)
{ if ( A[i] == item) return i; break; } //end if
}//end loop
//end Procedure [4]
2.2 Binary search tree
Binary search tree is also known as half-interval search or binary chop. [6]
Increasing the information leads to increase the speed of searching operations and more effective so the data must be ordered therefore this search algorithm searches only in a sorted array by finding the index of the position of the required element. [7]
The work principle of the binary search tree is that each time the middle is determined by the lower and higher elements then make a comparison between the middle and the required element