why is algorithm
-time consuming
-difficult in looping and branching
-difficult in putting big tasks
Answers
Answer:
Explanation:
-algorithm efficiency A measure of the average execution time necessary for an algorithm to complete work on a set of data. Algorithm efficiency is characterized by its order. Typically a bubble sort algorithm will have efficiency in sorting N items proportional to and of the order of N^ 2, usually written O(N ^2).
-A branch statement, or conditional statement, is code that allows you to test whether statements are true or false and then execute some code based on these comparisons.
-An algorithm is a step by step method of solving a problem. It is commonly used for data processing, calculation and other related computer and mathematical operations. An algorithm is also used to manipulate data in various ways, such as inserting a new data item, searching for a particular item or sorting an item.