This document contains code snippets for implementing four sorting algorithms: merge sort, insertion sort, bubble sort, and selection sort. For each algorithm, it includes a function prototype and a comment stating that the function counts the bytes of extra memory allocated for that sorting method.

1. 4578910111213141516171819204intextraMemoryAllocated;//implementmergesort//extraMemor
yAllocatedcountsbytesofextramemoryallocatedvoidmergeSort(intpData[],int1,int){}//implementi
nsertionsort//extraMemoryAllocatedcountsbytesofmemoryallocatedvoidinsertionSort(int*pData,i
ntn){}21222324252627282930313233//implementbubblesort//extraMemoryAllocatedcountsbyte
sofextramemoryallocatedvoidbubbleSort(int*pData,intn){}//implementselectionsort//extraMemo
ryAllocatedcountsbytesofextramemoryallocatedvoidselectionSort(int*pData,intn){}