THE RELEVANCE OF ALGORITHM IN PROGRAMMING (club 5050) BY @christnenye

INTRODUCTION

An algorithm is the step-by-step unambiguous instructions used to solve a given problem. Algorithms are not programs, they only develop computational techniques that can be used in any programming language. All algorithm are being judged with correctness that is if the algorithm gives solution to the problem in the infinite number of steps and efficiency that is how much resources in terms of memory and time it takes to execute the algorithm.

In programming these unambiguous algorithm (instructions) are been implemented into equivalent codes. The codes are therefore the definite/concrete representation of the algorithm.

WHY DO WE STUDY ALGORITHM

• Studying algorithm helps the programmer in thinking and understanding how or why problems are been solved in a certain way thereby giving the programmer less time to solve such problems in case of future occurrence.

• Studying algorithm helps in knowing the suitable and efficient steps in solving a particular problem that will consume less space, execute in lesser time and still give a better result when such algorithm is converted to a computer program.

• Studying algorithm helps the programmer in knowing what a program should do, in knowing that a drafted paperwork of steps (algorithm) on how and what they will do will be well written. The computer only produces the output of what is inputed into it (garbage in garbage out) therefore every computer program has to be manually solved before it is computed to get the desired output.

• Studying algorithm helps in knowing function point which include the loops that contains the methods of a program.

RELEVANCE OF ALGORITHM IN PROGRAMMING

Source

1. Optimization
   Using algorithms before programming will make the codes to be optimized that is to remove unnecessary lines of code that will utilize resources such as memory so that the code will run faster.

2. Finiteness
   Algorithm as defined as step by step instruction are of finite number which gives knowledgeable programmar the number of codes a particular computer program should have.

3. Debugging
   A well written algorithm that has been implemented into equivalent codes are easy to debug in programming.

4. Time complexity
   Time complexity here is execution time, the time a particular computer program will take to run is determined by the algorithm.

CONCLUSION
The way plans are in architecture is the same way algorithms are the most important thing in programming, a precise (steps) has to be made manually before it will be converted to suitable codes.

Thanks for reading, I appreciate.

Special thanks to @whitestallion