# Introduction to Algorithms

In this article, we are going to learn - **Introduction to Algorithms, properties, notations and example**.

Submitted by Mansha Lamba, on September 02, 2018

Algorithms are an integral part of the development world. Before starting coding of any software first an effective algorithm is designed to get desired outputs. In this article, we will understand what are algorithms, characteristics of algorithms, some examples of famous algorithms, Types of algorithms etc..

*Let's get started...*

## What is an Algorithm?

It is a combination of a sequence of finite steps to solve a particular problem. **or,** It is a well-defined procedure which takes zero or more input and must produce at least one output to solve a particular problem.

### Properties/Characteristics of Algorithms

**Input:**It may take zero or more input.**Output:**It must produce at least one output.**Definiteness (Unambiguous):**Every step in algorithm should be well defined, unique, precise.**Finiteness (Limited):**Every algorithm should contain a finite number of steps and should produce a result infinite amount of time.**Effectiveness:**Operations used in algorithm must be simple and easy to understand.- Language independent.

**Note:**

- An algorithm is a step by step procedure to solve a particular problem whereas a program is an algorithm that is encoded in any programming language.
- Program is language dependent and algorithm is language independent.

### Notation of an Algorithm

**Name of the algorithm:**It should specify the problem to be solved.**Step no.:**It is an identification tag ( step numbering ) that specify the numbering of steps/statements. It is a positive integer.**Explanatory comments:**It is used to specify the meaning of instruction that is used in the algorithm. It is used to understand the logic of operations by the use of [ ] for comments in the algorithm.**Termination:**Generally it is a STOP statement and the last statement of an algorithm that denoted ending of the algorithm.

### Example

**Algorithm for addition of two numbers:**

ADD( A , B ) Step 1: Read A,B Step 2: sum=A+B [ A & B are added and their value is stored in sum ] Step 3: PRINT ‘Sum of A & B =’, sum Step 4: STOP

This is an algorithm, the corresponding program will be different for different languages like for C language it is:

#include<stdio.h> int main() { int num1,num2,opt; printf("Enter the first Integer:\n"); scanf("%d",&num1); printf("Enter the second Integer:\n"); scanf("%d",&num2); printf("Enter an correct option -> 1:addition 2: subtraction 3: multiplication 4: division -> \n"); scanf("%d",&opt); switch(opt) { case 1: printf("\nAddition of %d and %d is: %d",num1,num2,num1+num2); break; case 2: printf("\nSubstraction of %d and %d is: %d",num1,num2,num1-num2); break; case 3: printf("\nMultiplication of %d and %d is: %d",num1,num2,num1*num2); break; case 4: if(num2==0) { printf("OOps Devide by zero\n"); } else { printf("\n Division of %d and %d is: %d",num1,num2,num1/num2); } break; default: printf("\n Enter correct option\n"); } return 0; }

**Output**

Enter the first Integer: 10 Enter the second Integer: 20 Enter an correct option -> 1:addition 2: subtraction 3: multiplication 4: division -> 3 Multiplication of 10 and 20 is: 200

### Types of Algorithm

- Divide and conquer algorithm
- Greedy algorithm
- Dynamic programming
- Branch and bound algorithm
- Back Tracking
- Simple Recursive algorithm
- Randomized algorithm
- Brute force algorithm

This was just the basic understanding of algorithm world. Read more articles/tutorials on Algorithms.

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.