18. Explain the following sort algorithms with a suitable example.
(a) nth_element() (b) partial_sort() (c) partial_sort_copy()
(d) sort() (e) stable_sort()
19. Describe how the heap operation algorithms are constructed in C++.
20. Summarise the list of comparison algorithms used in STL.
21. Explain the following numeric algorithm with a suitable example.
(a) accumulate() (b) adjacent_difference()
(c) inner_product() (d) partial_sum()
22. Explain the importance of function objects in C++.