Journal Article

Comparison of The Performance of 2d Binary Search Algorithm With Row Wise And Column Wise Search Algorithm On Sorted Matrix

Abstract

Binary Search Algorithm is an efficient algorithm when it comes to searching items within a sorted linear array. The technique, with little modification, can be applied to a sorted matrix and also maintain its efficiency. Row-Wise and Column-Wise Search Algorithm is also a very efficient algorithm that performs better than other algorithms when it comes to searching within a sorted matrix. This paper reports the findings when the performance analysis of the two algorithms are carried out using the following parameters: analysis of the operations performed by the functions used in the implementation, worst case iteration complexity, number of conditions check during the execution of each function that implements the algorithms and worst case time complexity of the algorithms. 2D Binary search algorithm was found to be more user friendly, simpler and time effective in that it requires lesser number of operations to be performed by the function that implements it, lesser number of iterations, lesser number of condition checks and smaller runtime complexity

Download pdf