Linear/Sequential searching is the basic search algorithm used in data structures. Linear search is used to find a particular element in a 2D array. It is not compulsory to arrange an array in any order (Ascending or Descending) as in case of 2D binary search. In this paper, I present a unique searching algorithm named Grid Search, which helps to search an unsorted 2D Array/Matrix with least time complexity and iteration. We also have compared the Grid searching algorithm with Linear Search Algorithm. We used C++ for implementation and analysis of CPU time taken by both the algorithms. Results have shown that Grid Searching Algorithm is working well for all input values and it takes lesser time than Sequential Searching in all aspects.
Paper Link:
http://ijcat.com/archives/volume5/issue1/ijcatr05011005.pdf
Citation:
BIBTEXT
@article{Guha_2016,doi = {10.7753/ijcatr0501.1005},url = {http://dx.doi.org/10.7753/ijcatr0501.1005},year = 2016,month = {jan},publisher = {Association of Technology and Science},volume = {5},number = {1},pages = {26--33},author = {Rehan Guha},title = {{GRID} {SEARCHING} Novel way of Searching 2D Array},journal = {{IJCATR}}}