COMP2247 - Algorithms and Data Structures

Syllabus Software Installation Assignments Tests
Lectures and Labs
**Back to Full Menu**

Algorithm Analysis BigONotations Program Algorithm Analysis Exercise



BigONotations Program


Description

This program conducts experimental tests on several algorithms' running times.

Associated Concepts:

BigO Notation

Algorithm:

main method:

Input the size of an array.

Create the array based on the user input.

Populate the array with random integers.

Call six methods to test their performances in terms of the Big O notations.

1 - O(LogN)
2 - O(N);
3 - O(NLogN)
4 - O(N2)
5 - O(N3)
4 - O(2N)

Source Code



Sample Run



Video