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:
The correct answer to the following question is option 4.
Explanation:
The private class does not mean that the package-private, it means that no other class can see its members.
It is used in creating the building blocks which is implementing the internal functionality that you don't want to visible to the other projects using the library.
We can use private constructor to ensure that more than one object cannot be created at the time.
Answer: See explanation
Explanation:
A flowchart simply means the representation of a computer program in graphics. In flowchart, the relationship in the program are been defined by using geometric symbols like arrows, oval shapes and rectangle.
Advantages of flowchart include cost reduction, faster and easier way of communication, it also facilitates troubleshooting and helps in the promotion of logical accuracy.
Disadvantages include the fact it is expensive and also because it is not easy to manage.