what is algorithm and Efficiency of the algorithm

 Algorithm:-

                       An algorithm is well defined list of steps to solve the particular problem. It takes set of input and gives the desired output.

Properties of an algorithm:-

1) Finiteness:-   An algorithm must always terminate after a finite number of steps.

2) Definiteness:- Each step of an algorithm must be precisely define and must be unambiguous.

3) Input:- An algorithm has 0 or more input.

4) Output:- An algorithm has 1 or more output.

5) Effectiveness : - It means that all of the operation of an algorithm must be so basic that it can be executed in a finite length of time , In an effective manner.

Efficiency of an Algorithm:-

                                                  Time and space are two major measures of the efficiency of an algorithm.

Example:- let's say there are two algorithms A and B . and it takes 10 second and 15 second respectively for completion and 40 MB and 13 Mb space respectively. Then in this case algorithm A is more efficient then B because it take less time for completion . We always give the priority to the time .

2) If there are Two algorithms A and B and both will take 10 second for completion . algorithm A take 15 MB and algorithm B take 3 MB . then in this condition Algorithm B is more efficient then A. because it take less space as compare to the algorithm A.

Efficiency / complexity of an algorithm is calculated by the Asymptotic notation. 

Recommended Post:

Full C course:-    

• C -Tutorial
  

Key points:-

• How to set limit in the floating value in python
  
• What is boolean data type
• How to print any character without using format specifier
• How to check that given number is power of 2 or not
  
• How to fix limit in double and floating numbers after dot (.) in c++
  
• How to print a double or floating point number in scientific notation and fixed notation
  
• How to take input a string in c
  
• How to reduce the execution time of program in c++.
  

Cracking the coding interview:-

 Array and string:-

• Is Unique
  
• Check Permutation
  
• Urlify
  
• One away
  
• String Compression
  
• Zero matrix
  

Tree and graph:-

• Route between nodes
  
• Minimal Tree
  
• List of Depth
  
• Validate BST
  
• Successor
  

Hackerearth Problems:-

• Very Cool numbers | Hacker earth solution
• Vowel Recognition | Hackerearth practice problem solution
  
• Birthday party | Hacker earth solution
• Most frequent | hacker earth problem solution
• program to find symetric difference of two sets
•  cost of balloons | Hacker earth problem solution
• Chacha o chacha | hacker earth problem solution
• jadu and dna | hacker earth solution
• Bricks game | hacker earth problem
• Anti-Palindrome strings | hacker earth solution
• connected components in the graph | hacker earth data structure
• odd one out || hacker earth problem solution
• Minimum addition | Hackerearth Practice problem
  
• The magical mountain | Hackerearth Practice problem
  
• The first overtake | Hackerearth Practice problem
  

Hackerrank Problems:-

•  Playing With Characters | Hackerrank practice problem solution
• Sum and Difference of Two Numbers | hackerrank practice problem solution
  
• Functions in C | hackerrank practice problem solution
  
• Pointers in C | hackerrank practice problem solution
  
• Conditional Statements in C | Hackerrank practice problem solution
  
• For Loop in C | hackerrank practice problem solution
  
• Sum of Digits of a Five Digit Number | hackerrank practice problem solution
  
• 1D Arrays in C | hackerrank practice problem solution
  
• Array Reversal | hackerrank practice problem solution
  
• Printing Tokens | hackerrank practice problem solution
  
• Digit Frequency | hackerrank practice problem solution
  
• Calculate the Nth term | hackerrank practice problem solution

Data structure:-

•   Program to find cycle in the graph
• Implementation of singly link list
• Implementation of queue by using link list
• Algorithm of quick sort
• stack by using link list
• program to find preorder post order and inorder of the binary search tree
• Minimum weight of spanning tree
  
• Preorder, inorder and post order traversal of the tree

Must check this:-

• PPS lab all the problems of 1st year 
• C- program of CPU scheduling Algorithms

 MCQs:-

• Engineering mathematics -4 MCQs
• CSS (Computer cyber security ) MCQS
•