Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
Answer:
solution
Explanation:
The correct option is - solution
Reason -
To solve a problem,
Firstly we give input , then system will process that input which then gives output.
Solution is not a part of the process.
So, Solution is not a significant part of a simple problem.
hit the sign in botten or create new account
1) Use a good cam 2) Make sure you focus on it 3) Make sure you snap it at the right time.... I hope this helps!!!!!
