Wednesday, December 27, 2017

Algorithms in c programing language

Algorithms

C is simple POP (PROCEDURAL ORIENTED PROGRAMING)  language an suitable for algorithm to code conversion work ,human brain prepares algorithm first, The steps to get maximum output with less number of steps. I gets experience, brain modularize repetitive task.

Algorithm defined:-

              Algorithm is a computer programing language are generally implementing a method that has been previously solve the some problem in the computer programing. This method is often independent of the  particular computer to be used—it is likely to be equally appropriate for many computers and many computer languages. It is the method, rather than the computer program itself, that we must study to learn how the problem is being attacked. The term algorithm is used in computer science to describe a problem-solving method suitable for implementation as a computer program.
          Most algorithms of interest involve methods of organizing the data involved in the computation. Objects created in this way are called data structures , and they also are central objects of study in computer science. Thus, algorithms and data structures go hand in hand. In this book we take the view that data structures exist as the byproducts or end products of algorithms, and thus that we must study them in order to understand the algorithms. Simple algorithms can give rise to complicated data structures and, conversely, complicated algorithms can use simple data structures.
        algorithms of interest involve methods of organizing the data involved in the computation. Objects created in this way are called data structures , and they also are central objects of study in computer science.
      The primary reason used to learn about algorithm design is that this discipline gives us the potential to reap huge savings, even to the point of making it possible to do tasks that would otherwise be impossible. In an application where we are processing millions of objects, it is not unusual to be able to make a program millions of times faster by using a well-designed algorithm.
        The choice of the best algorithm for a particular task can be a complicated process, perhaps involving sophisticated mathematical analysis. The branch of computer science that comprises the study of such questions is called analysis of algorithms . Many of the algorithms that we study have been shown through analysis to have excellent performance; others are simply known to work well through experience. Our primary goal is to learn reasonable algorithms for important tasks, yet we shall also pay careful attention to comparative performance of the methods. We should not use an algorithm without having an idea of what resources it might consume, and we strive to be aware of how our algorithms might be expected to perform. 
           Once problem has been defined, a detailed,finite, step- by step procedure for solving it must be developed. This procedure is known as algorithm. Algorithm can  be written ordinary language or using formal procedure that lie some where between ordinary and programing language.

     They are add two number of characters :- 

  • Read A,B.
  • Set sum := A+B.
  • Write sum 
  • Exit. 

PSEUDOCODE :-

            Sometimes it is desirable to translate an algorithm to an intermediate from, b/w that of a flow chart and source code pseudocode is an english approx.. of source code that follows the rules, style, and formate of a language ignore punctuation in c programing language.READ MORE

For example:-  

   Main()

{

Integer a,b, sum;

Read in a and b;

Add a & b and set it two sum ;

Write sum;

}

Algorithm flow chart :-
   
Flow chart of Algorithm 


        

0 comments:

Please comment and follow this site blog inbox