}\r
}\r
//\r
- // Swap pivot to it's final position (NextSwapLocaiton)\r
+ // Swap pivot to its final position (NextSwapLocation)\r
//\r
CopyMem (Buffer, Pivot, ElementSize);\r
CopyMem (Pivot, (UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), ElementSize);\r
CopyMem ((UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), Buffer, ElementSize);\r
\r
//\r
- // Now recurse on 2 paritial lists. Neither of these will have the 'pivot' element.\r
+ // Now recurse on 2 partial lists. Neither of these will have the 'pivot' element.\r
// IE list is sorted left half, pivot element, sorted right half...\r
//\r
QuickSortWorker (\r