Author: admin2

In Binary Search algorithm,During the search an element we reduce the array size by half in every search iteration. We use the three parameter (Low,mid,High). Low indicates the first index of array ,High indicates the Last index of array and Read More …

When the array or list are already sorted,then we are lucky ,because there is no need to scan all the element of array or list. here we will take the advantage of already ordered list, and applied some condition to Read More …

Let us assume that given an array, the order of the elements is unknown. this means The elements of the array are not sorted,So it is also called Unsorted Linear Search, In this situation, to search for elements, we need Read More …

broadly Search Algorithms are categorized following :1- Sequential Search or Linear Search2- Interval Search 1-Sequential Search This type of Searching algorithm use when data is Unordered or Unsorted.In this searching type, we check all the elements of list or array.Example Read More …

Search is the process of finding items from a list or collection of items or collection of attributes, These items can be anything which can stored in the form of records in the database, or just a homogeneous items are Read More …

We Analyze an algorithm to know that which inputs give the best result in the form of performance and which inputs give the bad result means taking more time to complete the task, and also some inputs also give average Read More …

The rate at which the running time increases as a function of input is called rate of growth. let us Suppose you go to a store to buy cars and bicycles. If your friend meets you there and ask What Read More …

To Analyze an algorithm ,we generally focus on the Time Complexity and Space Complexity, but another factors are also here like Memory, Developer,Effort,Cost of Maintenance etc. Running Time Analysis This is the process of determining how the processing time increases Read More …

To go from city “X” to city “Y”, you can use multiple methods to achieve: take an airplane, take a bus, Train and bicycle. According to availability and convenience, we choose one Suitable for us. Similarly, in computer science, there Read More …

Let us say the problem of preparing a cup tea. To prepare a cup of tea, we follow the steps given below: 1) Get the kettle and boil the water in the kettle. 2) Get the milk. a. Do we Read More …