Algoritms

An algorithm is a set of step-by-step procedures, or a kind of instruction set that is used to solve a specific task or to process data.
Algorithms are used in Computer Science to perform tasks such as sorting and searching data, or to solve problems like finding the shortest path through a graph.
Algorithmic complexity, often referred to as time complexity, refers to the computational complexity that describes the amount of resources needed by an algorithm to run.
The use of algorithms is fundamental in fields like Data Analysis, Machine Learning, Artificial Intelligence, and more.

There are various types of algorithms, but some common ones include Divide and Conquer, Dynamic Programming, Greedy, Backtracking, and Brute Force.
Divide and Conquer algorithms divide the problem into subproblems of the same type, solve them individually and combine them to get the final result.
Dynamic Programming algorithms solve problems by breaking them down into simpler, smaller problems, and storing the results of these subproblems to avoid duplicate work.
Greedy algorithms make the locally optimal choice at each decision with the hope that these local choices will lead to a global optimum.
Backtracking is an algorithmic-technique for solving problems incrementally, by trying to build a solution incrementally, one piece at a time, and removing those solutions that fail to satisfy the constraints of the problem at any point of time.
Brute Force algorithms are straightforward methods of solving a problem that rely directly upon the problem’s statement and definitions of the concepts involved.

An algorithm should be clear and must have a well-defined set of instructions.
An algorithm should be effective, and all of its steps should be easy to follow.
In defining an algorithm, one should confirm that it will eventually stop after computing a finite number of steps, which is called termination.
The design and analysis of algorithms is the key to understanding whether or not the algorithm is efficient in terms of time and space complexity.
An understanding of data structures, such as arrays, lists, stacks, and queues, is integral to creating and employing effective algorithms.

Algorithms play a crucial role in the functioning of any software or program, such as in programming languages, where algorithms form the backbone of any program.
Understanding algorithms helps in improving the efficiency of a program and in minimising computing resource usage.
Search engines like Google and Bing use proprietary algorithms to generate search results.
Algorithms are also used in path-finding for maps, like Google Maps, where they calculate the shortest or fastest routes from A to B.
Social media platforms use algorithms to customise what users see on their feeds.