imagine a circular linked list of integers that are sorted into ascending order as shown in the attached file.
The external pointer list points to the last node, which contains the largest integer.
Write a function that revises the list so that its data are sorted into descending order as shown in the attached file.
Do not allocate or deallocate nodes.
See attached file for diagrams.
Attachment:- Circular Linked List.zip