Hi, I hope this is useful
http://www.indiastudychannel.com/projects/2748-Assembly-language-program-for-Binary-search.aspx
good luck!
Binary Search Algorithm
The best search algorithm to use for a sorted array is the binary search algorithm.
The running time of the binary search algorithm is O(log n), where n is the number of elements in the sorted array being searched.
The time complexity of a binary search algorithm is O(log n), where n is the number of elements in the sorted array being searched.
The time complexity of a binary search algorithm in computer science is O(log n), where n is the number of elements in the sorted array being searched.
The time complexity of an algorithm that uses a binary search on a sorted array is O(log n), where n is the size of the input array.
n log n - G.Parthiban, SRM
By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.
i want to know how to give the algorithm password in a computer ?
The time complexity of an algorithm that uses binary search to find an element in a sorted array in logn time is O(log n).
One can perform a binary search easily in many different ways. One can perform a binary search by using an algorithm specifically designed to test the input key value with the value of the middle element.
In a binary search algorithm, typically log(n) comparisons are made when searching for a specific element in a sorted array, where n is the number of elements in the array.