The week's pick
Reseach Article
10x Matrix Searching Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 148 - Number 8 |
| Year of Publication: 2016 |
| Authors: Ajay Kedia, Shagun Dhingra |
10.5120/ijca2016911258
|
Ajay Kedia, Shagun Dhingra . 10x Matrix Searching Algorithm. International Journal of Computer Applications. 148, 8 ( Aug 2016), 37-43. DOI=10.5120/ijca2016911258
Abstract
Searching is the main fundamental concept using in computer Science to get the data from unsorted and sorted elements. There are a number of searching algorithms present in computer science. Here, we are going to introduce with new searching algorithms i.e. 10x Matrix Searching algorithms. 10x refer to a table which contains only 10 rows and x refer to the columns associated with each row. So, basically we are going to search an item from a collection of items. These item may be a part of database, may be a part of some formula or procedure which are going to use in our programs, like we are finding some solution of an equation and we need the root of an equation.
References
- Narasimha Karumanchi, Data Structure and algorithms Made Easy in Java: Data structure and Algorithms.
- Jagged array example. Online http://www.dotnetperls.com/jagged-array .
- Linear and Binary searching example. Online www.cprogramming.com/discussionarticles/sorting_and_searching.html
- En.m.wikipedia.org/wiki/Linear_search.
Index Terms
Keywords