“If you want to progress, you have to evaluate”; Today not only the humans but the computers have evaluated as well, concerning their performance, usability and stability. In the earlier days when the computer was invented it was supposed to do basic tasks like computations and today almost all of our daily life work is handled by the computers. This journey of computers from a single task calculator to game changer is a tremendous journey and today we are going to focus on that journey. What is a Computer? A computer is nothing but an electronic device that performs processes calculation and operation from given instructions [1]. Computation consists of three commands as input, process, and output at where the input is the instructions that we are providing to the computer through our input devices such as keyboard, mouse, and joystick. Then as receiving the input, the computer hardware starts processing the input and after completing the process it produces the output to the user using the output hardware such as a monitor, printer etc. How did it start? Who first thought about the computer? Who invented this ultrasmart device? The computer was invented in the 19th century by…

The study of data structures for facilitating rapid searching is a fascinating subject of both practical and theoretical interest. Sorting and Searching are two fundamental operations in a computer science. Sorting means arranging on data in given order such that increment or decrement. Searching means find out location or find out an element of a given item in a collection of item. Searching element is any type of a numerical data, alphabet, String, character data. Every searching algorithm depends on specific problem, property of data and algorithm complexity. A search algorithm is the step by step procedure used to locate specific data among the collections of data. Searching is considered as the most fundamental procedure in computer science. When the data is to be searched, the difference between a fast application and a slower one lies in the use of proper search algorithms. Definition of Linear Search Linear search, also known as sequential search, is a process that checks every element in the list sequentially until the desired element is found. The computational complexity for linear search is O(n), making it generally much less efficient than binary search (O(log n)). Linear search (sequential search) is the most simple approach to…