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:c ll d
Explanation:
cus they are inside ()--parantheses
Answer:
Begin the statement with the proper keyword to start the loop
Explanation:
Given
The code segment
Required
Fix the code
The first line of the code segment is meant to be a for loop, but it does follow the right syntax.
This is so because the for keyword is missing.
The first line should be corrected and replaced with:
for count in range(80):
Hence, option (b) is correct
there are different ones like
Not Otherwise Specified
Network Operating System
