I have an algorithm that runs in O(n 2 ), where n is the size of the problem. What does “the size of the problem” mean?
What will be an ideal response?
The count of something that is characteristic of the problem. Examples are
Sorting: N is how many items there are to be sorted
Searching: N is how many items there are to be searched through
Compiling: N is the number of tokens in the program to be compiled.
Computer Science & Information Technology
You might also like to view...
Replacing a CPU is usually very helpful in improving overall computer performance
Indicate whether the statement is true or false
Computer Science & Information Technology
A(n) ________ can cause MD5 hashes to be different if different tools are used to acquire a disk image
Fill in the blank(s) with correct word
Computer Science & Information Technology