In the merge sort, you will be able to breakdown your sorting list into small sub-lists to sort them independently. Then, you will be able to combine (merge) the sorted sub-lists one level at a time. Finally, you will be able to get the finalized sorted list. GPUs provide the capability to perform multiple operations on a set of data. In this assignment, we will use the processing elements in the GPUs to perform the merge sort on a list of items. We will use CUDA as our IDE for design the merge sort on an NVIDIA GPU. You can test your design on a list of 1024 elements. But your design should have the flexibility to sort lists of any number of elements.

I need anything that would help me, understanding/implementing the code.