Q. An array consists of n elements. We want to create a heap using the elements. The time complexityof building a heap will be in order of (Solved)
1. O(n*n*logn)
2. O(n*logn)
3. O(n*n)
4. O(n *logn *logn)
- b. O(n*logn)
1. O(n*n*logn)
2. O(n*logn)
3. O(n*n)
4. O(n *logn *logn)