Header Ads Widget

what is algorithm and Efficiency of the 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:-    

Key points:-

Cracking the coding interview:-

 Array and string:-

Tree and graph:-

Hackerearth Problems:-

Hackerrank Problems:-

Data structure:-


Post a Comment