Editor/Reviewer loginFrequency : 12 issues per year
Subject : Computer Applications and Technology
ISSN : 2319–8656 (Online)
IJCATR Volume 5 Issue 1
GRID SEARCHING Novel way of Searching 2D Array
Rehan Guha
10.7753/IJCATR0501.1005
keywords : Matrix Searching algorithms; 2D Array Searching algorithms; 2D Array Linear Searching; 2D Array Grid Searching; Complexity Analysis; Algorithms; Searching Algorithms
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.
@artical{r512016ijcatr05011005,
Title = "GRID SEARCHING Novel way of Searching 2D Array",
Journal ="International Journal of Computer Applications Technology and Research(IJCATR)",
Volume = "5",
Issue ="1",
Pages ="26 - 33",
Year = "2016",
Authors ="Rehan Guha"}
The paper proposes (Grid Searching) an efficient searching of an unsorted data present in 2D array/matrix
Grid Searching searches the 2D array/matrix in grid pattern (searching the boundary of an element).
Grid Searching has the Order of complexity of O(n2/9) whereas Linear searching has the Order of complexity of O(n2).
Grid Searching has the least Worst-case complexity and Worst-case time complexity with respect to Linear Searching in2D array/matrix.