Heap sort is an __________ sorting algorithm.
a) O(1)
b) O(n)
c) O(n log n)
d) O()
e) none of the above
c) O(n log n)
You might also like to view...
Which of the following statements is false (assume we're referring to class Time)?
a.Often a class’s interface and implementation will be created and compiled by one programmer and used by a separate programmer who implements the client code that uses the class. b. To hide the class’s member-function implementation details, the class-implementation programmer would provide the client-code programmer with the header Time.h (which specifies the class’s interface and data members) and the Time object code (i.e., the machine-code instructions that represent Time’s member functions). c. The client-code programmer is not given Time.cpp, so the client remains unaware of how Time’s member functions are implemented. d. The client-code programmer needs to know only Time’s interface to use the class and must be able to link its object code.
What is a base class?
A. A general class. B. Special case of the derived class. C. Polymorphism. D. All of the above.
What output is produced by the following code fragment?
``` int limit = 100, num1 = 15, num2 = 40; if (limit <= limit) { if (num1 == num2) System.out.println("lemon"); System.out.println("lime"); } System.out.println("grape"); ```
_______________ filtering provides more security than _______________ filtering.
Fill in the blank(s) with the appropriate word(s).