Blog

Hash Algorithm : Hash Algorithm is a Hash function that takes a string of any length and decreases it to a unique fixed length string. It is used for password validity, message & data integrity and for many other cryptographic …

Ques. :  What is an algorithm in computing? Ques. : What is the need of Algorithm? Ques. : What are the features of a good algorithm? Ques. : How an algorithm is different from Flowchart? Ques. : What are the …

Difference between Algorithm and Flowchart Slno. Algorithm Flowchart 01. A method of representing thestep-by-step logical procedure for solving a problem. Flowchart is pictorial representation of an algorithm. It is constructed using different types of boxes and symbols. 02. It describes …

Analysis of Algorithm  The field of computer science, which studies efficiency of algorithms, is known as analysis of algorithms. The time and space used by the algorithm(M) are the two main measures for the efficiency of an algorithm. The analysis …

Link for Complexity Notations Complexity of Algorithm Introduction Complexity simply means difficulties in a process. Definition Algorithm complexity is a measure of the resources required by an algorithm as a function of input size to solve a problem. The two …

Divide & Conquer Binary search Multiplication of two n-bits numbers Quick Sort Heap Sort Merge Sort Greedy Method Knapsack (Fractional) Problem Minimum Cost Spanning Tree Kruskal‟s algorithm Prim‟s algorithm Single Source Shortest Path Problem Dijkstra’s Algorithm Dynamic Programming All Pair …

Introduction The Branch and Bound algorithm is a powerful technique for solving optimization problems that has been successfully applied to a wide range of problems. Its effectiveness/performance depends on the quality of the bounds used to prune the search space, …

Introduction It is one of the very important types of algorithms. Definition Backtracking is a general algorithmic technique that is used to solve a wide range of problems, including combinatorial optimization problems, constraint satisfaction problems, and other problems that involve …

Introduction The dynamic Programming method is a famous algorithmic principle used widely in several applications. Definition Dynamic programming is a technique for solving complex problems by breaking them down into smaller & simpler sub-problems and solving each sub-problem only once, …

Introduction The greedy principle is an algorithm design paradigm in which the algorithm makes the locally optimal choice at each step in the hope of finding a globally optimal solution. Definition The greedy principle is a heuristic algorithmic technique in …