I have an algorithm that runs in O(n2)time, where n is the size of the problem. What does “the size of the problem” mean?
What will be an ideal response?
The “size” of a problem is the number of some kind of operation that is characteristic of the problem. For sorting and searching, it is the number of elements in the container. For a compiler may be the number of lines of code or the number of tokens.
You might also like to view...
Match the following terms to their meanings:
I. Enable you to copy files to the disc on several occasions A. metadata II. Data that describes other data B. Live File System III. A disc onto which files can be copied C. burning a disc IV. Used to copy files more likely compatible with D. writable disc older computers V. Process of writing files to a disc E. Mastered File System
Which dialog box allows the user to print all comments?
A) Print B) Page Layout C) Backstage D) Page Setup