Reported Question / Answer
3. O(n2)
Q) Complexity of Bubble Sort Algorithm is: 3)c. O(n2) [Worst Case Time Complexity] Best Case Time Complexity : O(n) Space Complexity : O(1) [This in an in-place algorithm. So the memory space doesn't grow with the number of inputs to the array] By default, time complexity means worst case time complexity.
Answer will be 3rd O(n^2)
3) c. O(n^2)
Answer would be c option o(n2)
c
Reading Corner ( Ctrl + Mouse Click)
Managed Services By: www.upscgk.com