Whats an effective way to sort linked lists in cpp.

Using Merge Sort.

Explanation:

Merge Sort is preferred for sorting the linked list because the the data stored in linked list is not in serial memory address which makes the quick sort algorithm very slow and other sorting algorithms impossible.

Merge Sort is a divide and conquer algorithm.

In this algorithms we divide the linked list into sub parts and sort the sub parts of the linked list and then we merge them in sorted order. It is a very effective approach for linked list sorting.

The time complexity of merge sort is O(NLogN).

the answer to your question would be something called hertz. the unit of measurement called a hertz, which is one cycle per second, is used to measure clock speed. within one cycle, your computer processes, refreshes, or updates itself to the changes that it is going through. in the case of computer clock speed, one hertz equals one tick per second. the clock speed of computers is usually measured in megahertz (mhz) or gigahertz (ghz)