1. a.An algorithm can be specified in various ways. Identify and explain four ways in which an algorithm can be specified. b. (b). Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as follows: A = 2n7 + 100n4 + 26n + 50 B = 7n4 + 22n2 + nlogn + 200 For very large values of n, which of the algorithms A or B will run in the shortest time to solve the problem and why? (c). Two Computer Science students, Priscilla and Julius, are discussing how to compare two algorithms for solving a given problem. Priscilla suggests that they should use the execution times of the algorithms as criterion; but Julius insists that they should use the number of statements the algorithms execute as criterion.
1. a.An
explain four ways in which an algorithm can be specified.
b. (b). Two algorithms A, B sort the same problem. When you go
through each algorithm and break them down into their
primitive operations, each can be represented as follows:
A = 2n7 + 100n4 + 26n + 50
B = 7n4 + 22n2 + nlogn + 200
For very large values of n, which of the algorithms A or B will run
in the shortest time to solve the problem and why?
(c). Two Computer Science students, Priscilla and Julius, are
discussing how to compare two algorithms for solving a
given problem. Priscilla suggests that they should use the
execution times of the algorithms as criterion; but Julius
insists that they should use the number of statements the
algorithms execute as criterion.
(i). Discuss the reasons why both criteria they are
considering are not good for comparing algorithms.
(ii). Recommend an ideal solution/criterion that they
should rather use for comparing algorithms
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
