Simply, they are procedure to solve a problem. As example you might have an algorithm for getting form home to school, for making grill cheese sandwich, or finding what you looking for in grocery store. In computer science, an algorithm is a set of steps for computer program to accomplish a task. Algorithm put the science in computer science. And finding good algorithm and knowing to when to apply them will allow you to write interesting and important programs. Let’s talk about famous algorithms: how does Google Hangouts transmit live video across the internet so quickly? They use audio and video compression algorithm. How does Google map figure out how to get any corner of the city or far to the country. They use a route finding algorithm. How does NASA choose how to arrange solar panels on international space station and when to re arrange them? They use an optimization and scheduling algorithm. Those algorithms are more complex than our every day algorithm like making grilled cheese sandwich. But they boiled down to same thing, a sets of steps to complete a task.
Creating new algorithm
In Biological science new algorithm are continually being designed with purposes like designing the molecular structures that are the core of disease fighting drugs. In physic algorithm simulates climate and weather pattern. In other algorithms, search and analyze the vast data about stars in the universe collected by automated space telescopes. Across all the science and even on the websites various algorithms are needed to analyze huge data sets or to select intelligently from vast number of possible decision.
Brute force algorithm
Brute Force Algorithms refers to a programming style that does not include any shortcuts to improve performance, but instead relies on sheer computing power to try all possibilities until the solution to a problem is found.
A classic example is the traveling salesman problem (TSP). Suppose a salesman needs to visit 10 cities across the country. How does one determine the order in which cities should be visited such that the total distance traveled is minimized? The brute force solution is simply to calculate the total distance for every possible route and then select the shortest one. This is not particularly efficient because it is possible to eliminate many possible routes through clever algorithms.
Another example: 5 digit password, in the worst case scenario would take 105 tries to crack.
The time complexity of brute force is O(n*m) . So, if we were to search for a string of ‘n’ characters in a string of ‘m’ characters using brute force, it would take us n * m tries.
Updated.