Examen
CSC 325 Practice Test Questions and Correct Answers
- Cours
- Établissement
Big O Notation A way of expressing the worst-case run-time of an algorithm, useful for comparing the speed of two algorithms. Big Theta Notation A way to express the average case runtime of an algorithim, Big Omega Notation A way to express the lower bound of an algorithims run time Loop Invaria...
[Montrer plus]