The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon inorder to get the expected results.
Let’s take a look at an example for a better understanding. As a programmer, we are all aware of the Linear Search program. (Linear Search)
Algorithm of linear search :
1. Start from the leftmost element of arr and one by one compare x with each element of arr. 2. If x matches with an element, return the index. 3. If x doesn’t match with any of elements, return -1.
Here, we can see how the steps of a linear search program are explained in a simple, English language.
A flowchart is a graphical representation of an algorithm. Programmers often use it as a program-planning tool to solve a problem. It makes use of symbols which are connected among them to indicate the flow of information and processing.
The process of drawing a flowchart for an algorithm is known as “flowcharting”.
Example: Draw a flowchart to input two numbers from the user and display the largest of two numbers
Let’s see the difference between algorithm and flow chart:-
|1.||Algorithm is step by step procedure to solve the problem.||Flowchart is a diagram created by different shapes to show the flow of data.|
|2.||Algorithm is complex to understand.||Flowchart is easy to understand.|
|3.||In algorithm plain text are used.||In flowchart, symbols/shapes are used.|
|4.||Algorithm is easy to debug.||Flowchart it is hard to debug.|
|5.||Algorithm is difficult to construct.||Flowchart is simple to construct.|
|6.||Algorithm does not follow any rules.||Flowchart follows rules to be constructed.|
|7.||Algorithm is the pseudo code for the program.||Flowchart is just graphical representation of that logic.|
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Difference between RSA algorithm and DSA
- Difference between Algorithm, Pseudocode and Program
- Difference between Prim's and Kruskal's algorithm for MST
- Difference between SSTF and LOOK disk scheduling algorithm
- Difference between FCFS and C-LOOK disk scheduling algorithm
- Difference between C-SCAN and SSTF Disk Scheduling Algorithm
- Difference between FCFS and SSTF Disk Scheduling Algorithm
- Difference between First Come First Served (FCFS) and Round Robin (RR) Scheduling Algorithm
- Difference Between Flood-fill and Boundary-fill Algorithm
- Comparions between DDA and Bresenham Line Drawing algorithm
- First Fit algorithm in Memory Management using Linked List
- Shortest path in a directed graph by Dijkstra’s algorithm
- Program for Best Fit algorithm in Memory Management using Linked List
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Real time optimized KMP Algorithm for Pattern Searching
- Widest Path Problem | Practical application of Dijkstra's Algorithm
- Cohen-Sutherland vs. Liang-Barsky line clipping algorithm
- Queries for Count of divisors of product of an Array in given range | Set 2 (MO's Algorithm)
- Difference between HLP and PCP
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : pp_pankaj