A merge sort operation runs in:

a. O(log n) time.
b. O(n) time.
c. O(n log n) time.
d. O(n 2 ) time.

c. O(n log n) time.

Computer Science & Information Technology

You might also like to view...

Which of the following was a major change in Mac OS X that first occurred with Snow Leopard?

A. support for TCP/IP B. support for only Intel-based processors C. a new protocol called AppleTalk D. Split View was introduced

Computer Science & Information Technology

What is the output of the following program? #include using namespace std;class bClass{public:void print() const;bClass(int a = 0, int b = 0);//Postcondition: x = a; y = b;private:int x;int y;};class dClass: public bClass{public:void print() const;dClass(int a = 0, int b = 0, int c = 0);//Postcondition: x = a; y = b; z = c;private:int z;};int main(){bClass bObject(2, 3);dClass dObject(3, 5, 8);bObject.print();cout << endl;dObject.print();cout << endl;return 0 ;}void bClass::print() const{cout << x << " " << y << endl;}bClass::bClass(int a, int b){x = a;y = b;}void dClass::print() const{bClass:print();cout << " " << z << endl;}dClass::dClass(int a, int b, int c): bClass(a, b){z = c;}

A. 2 3 2 3 B. 2 3 3 5 8 C. 3 5 8 3 5 8 D. 5 8 3 5 8

Computer Science & Information Technology