Description
True or False:
1. [1 pts ] The complexity of insertion algorithm is O(n^2).
2. [1 pts] Any algorithm can be represented by combination of the three primary control structures.
3. [1 pts ] An algorithm is said to be correct if it can halt on all input.
Short Answers:
4. [3 pts] Write down the three primary control structures:
5. [2 pts] What is the difference between WHILE loop and REPEAT loop:
6. [2 pts] What are the two indispensable part of any formal logic system?
