M

Mr. Dubey • 100.69K Points
Coach

Q. Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively.

  • (A) 0(log n), 0(log n), o(log n)
  • (B) o(n2), o(n2), o(n2)
  • (C) o(n2), o(n log n), o(n log n)
  • (D) o(n log n), o(n2), o(n log n)
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. In the TEM mode, Ez ______ and Hz =_______

Q. In current commutated DC-DC choppers, the voltage spike appears across the load when

Q. The base emitter voltage of the second approximation is ?

Q. A mica capacitor and a ceramic capacitor both have the same physical dimensions. Which will have more value of capacitance ?

Q. The theorem is a way to determine the currents and voltages present in a circuit that has multiple sources.

Q. The amount of dielectric heating is inversely proportional to frequency.

Q. In 8 connected region if one pixel is (3,2) then remaining neighboring pixels are

Q. How many bytes are there in binary number 1001101000111010 ?

Q. A window with 6 clipping boundaries can be considered under___ clipping.

Q. An XOR gate produces output only when two inputs are ?

Question analytics