![]() Big tasks are difficult to put in Algorithms. Difficult to show Branching and Looping in Algorithms.ģ. By using algorithm, the problem is broken down into smaller pieces or steps hence, it is easier for programmer to convert it into an actual program.Ģ. ![]() ![]() Every step in an algorithm has its own logical sequence so it is easy to debug.ĥ. It is not dependent on any programming language, so it is easy to understand for anyone even without programming knowledge.Ĥ. An algorithm uses a definite procedure.ģ. It is a step-wise representation of a solution to a given problem, which makes it easy to understand.Ģ. A computer program can be viewed as an elaborate algorithm”.ġ. ![]() Standard Defination : “ An algorithm is a procedure or formula for solving a problem, based on conductiong a sequence of specified actions. In simple words Algorithms is ‘Logic or Procedure of solving any Problem. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |