sort

1. What is the best-case time complexity of Bubble Sort?

• O(n²)

• O(n)

• O(log n)

• O(n log n)

Which of the following statements is TRUE about Bubble Sort?

• It is always faster than Merge Sort

• It uses divide-and-conquer

• Largest Element goes towards end in each end

• It requires O(n log n) space

Which Tree ?

• Full Binary Tree

• Max Heap Tree

• Complete Binary Tree

• Min Heap Tree

WHICH TREE ?

• FULL BINARY TREE
  NOT COMPLETE BINARY TREE

• COMPLETE BINARY TREE

• NOT BOTH

• MAX HEAP TREE

WHICH TREE ?

• ❌ FULL BINARY TREE
  ✔️ complete BINARY TREE

• ✔️FULL BINARY TREE
  ❌ complete BINARY TREE

• ❌ FULL BINARY TREE
  ❌ COMPLETE BINARY TREE

• ✔️FULL BINARY TREE
  ✔️complete BINARY TREE

WHICH TREE?

• MAX HEAP

• MIN HEAP

• MIN-max HEAP

• NO IDEA BRO

WHICH TREE

• MAX HEAP

• MIN HEAP

• FULL TREE

• HALF MANDI

WHICH OF THE SORTING FOLLOWING ALGORITHMS HAS THE BEST AVERAGE CASE TIME COMPLEXITY

• BUBBLE SORT

• INSERTION SORT

• MERGE SORT

• SELECTION SORT

WHICH OF THE FOLOWING SORTING ALGORITHMS IS IN-PLACE AND STABLE

• HEAP SORT

• MERGE SORT

• BUBBLE SORT

• QUICK SORT

IN HEAP SORT, THE TIME COMPLEXITY TO BUILD MAX HEAP FROM AN UNSORTED ARRAY OF N ELEMENTS IS

• O(n log n)

• o(log n)

• o(n)

• o(n^2)