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.

In computer Science, Sorting algorithm is used to place the elements in a certain order or to arrange the data of the array or string in a particular order. Sorted Data has been used to design the database which contains the array values in a certain order. Typically, Sorting Algorithm is used to arrange the data either in increasing order to decreasing order. There are certain types of sorting algorithm which are used to sort an array and have different cost and time complexity but we have discussed only new sorting algorithms designed by us.