What is an Algorithm

Algorithm in Programming

In programming, algorithm is a set of well defined instructions in sequence to solve the problem.

Qualities of a good algorithm

  1. Input and output should be defined precisely.
  2. Each steps in algorithm should be clear and unambiguous.
  3. Algorithm should be most effective among many different ways to solve a problem.
  4. An algorithm shouldn't have computer code. Instead, the algorithm should be written in such a way that, it can be used in similar programming languages.

Examples Of Algorithms In Programming

Write an algorithm to add two numbers entered by user.
 
Step 1: Start
Step 2: Declare variables num1, num2 and sum. 
Step 3: Read values num1 and num2. 
Step 4: Add num1 and num2 and assign the result to sum.
        sum←num1+num2 
Step 5: Display sum 
Step 6: Stop

Write an algorithm to find the largest among three different numbers entered by user.
 
Step 1: Start
Step 2: Declare variables a,b and c.
Step 3: Read variables a,b and c.
Step 4: If a>b
           If a>c
              Display a is the largest number.
           Else
              Display c is the largest number.
        Else
           If b>c
              Display b is the largest number.
           Else
              Display c is the greatest number.  
Step 5: Stop

Write an algorithm to find all roots of a quadratic equation ax2+bx+c=0.
 
Step 1: Start
Step 2: Declare variables a, b, c, D, x1, x2, rp and ip;
Step 3: Calculate discriminant
         D←b2-4ac
Step 4: If D≥0
              r1←(-b+√D)/2a
              r2←(-b-√D)/2a 
              Display r1 and r2 as roots.
        Else     
              Calculate real part and imaginary part
              rp←b/2a
              ip←√(-D)/2a
              Display rp+j(ip) and rp-j(ip) as roots
Step 5: Stop

Write an algorithm to find the factorial of a number entered by user.
 
Step 1: Start
Step 2: Declare variables n,factorial and i.
Step 3: Initialize variables
          factorial←1
          i←1
Step 4: Read value of n
Step 5: Repeat the steps until i=n
     5.1: factorial←factorial*i
     5.2: i←i+1
Step 6: Display factorial
Step 7: Stop

Write an algorithm to check whether a number entered by user is prime or not.
 
Step 1: Start
Step 2: Declare variables n,i,flag.
Step 3: Initialize variables
        flag←1
        i←2  
Step 4: Read n from user.
Step 5: Repeat the steps until i<(n/2)
     5.1 If remainder of n÷i equals 0
            flag←0
            Go to step 6
     5.2 i←i+1
Step 6: If flag=0
           Display n is not prime
        else
           Display n is prime
Step 7: Stop
 
Write an algorithm to find the Fibonacci series till term≤1000.
 
Step 1: Start 
Step 2: Declare variables first_term,second_term and temp. 
Step 3: Initialize variables first_term←0 second_term←1 
Step 4: Display first_term and second_term 
Step 5: Repeat the steps until second_term≤1000 
     5.1: temp←second_term 
     5.2: second_term←second_term+first term 
     5.3: first_term←temp 
     5.4: Display second_term 
Step 6: Stop

Algorithm is not the computer code. Algorithm are just the instructions which gives clear idea to you idea to write the computer code.


Comments

Post a Comment

Popular posts from this blog

C Programming Tutorials

This is a complete step by step procedure of learning programming language. Do you want to learn C or C++ instead? Check out our Practical Blog and Tutorial. Here You will get the information of Data Type, Variable, Operator(Arithmetic, Comparison and Conditional), Function(User-defined and Built-in), Conditional Statement(IF, IF ELSE, GOTO and SWITCH), Looping(FOR,  WHILE and DO-WHILE), Pointer and Pointer Array, Structure, Array(1D, 2D and MULTI DIMENSIONAL) and File Programming etc. Further More you will get lots of program of Logics, Graphics, Game and Mathematics etc. Link : C Programming Blog
Read more

DataStructure and Algorithm

Data structures and Algorithm in C or C++ documentations are available here. You will get complete Algorithm, Theorem, Prove and pseodocode and also executable source code here. Learn about Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, Heap Sort, Radix Sort, Shell Sort, Quick Sort, Link List Programming, Linear Array Programming, Binary Search and Linear Search etc. Simplified presentation of Arrays, Recursion, Linked Lists, Queues, Trees, Graphs, Sorting, Searching Methods and Hashing. Reference: Schaum's Outlines - Data Structures with C Introduction What is an algorithm? Why you should learn algorithms Algorithm Analysis Big-O notation Sorting Insertion Sort Selection Sort Bubble Sort Heap Sort Merge Sort Quick Sort Shell Sort Counting Sort Radix Sort Bucket Sort Basic Data Structures Stack Queue Circular Queue Linked List Types of Linked List Linked List Operations Advanced Data Structu...
Read more

Java Programming Tutorial

Java is a programming language and computing platform first released by Sun Microsystems in 1995. There are lots of applications and websites that will not work unless you have Java installed, and more are created every day. Java is fast, secure, and reliable. From laptops to datacenters, game consoles to scientific supercomputers, cell phones to the Internet, Java is everywhere! Students should have taken the Software Development for Non-Programmers course or have programmed in at least one programming language preferably C or C++. Some familiarity with Object Oriented Programming is desired but not required. Our Blog covers the practice examples of Traditional Programming Components, Object Oriented Programming, Methods, Arrays, Encapsulation, Inheritence and Polymorphism, Abstract Classes and Interfaces, Exceptions, Input and Output, Threads, Collections and Networking etc. Link: Java : Java Enterprise Programming
Read more