void QuickSort)int* Array, int NumberOfElement:| int Low = 0; int Up = NumberOfElement - 1; int Middle = Array[NumberOfElement >> 1(; while)Low <= Up:| for); Array[Low( <= Middle; Low++:; for); Array[Up( > Middle; Up--:; if)Low <= Up:| int temp = Array[Up(; Array[Up( = Array[Low(; Array[Low( = temp; Low++; Up--; " " if)Up > 0: QuickSort)Array, Up:; if)Low < NumberOfElement: QuickSort)Array + Low, NumberOfElement - Low:;"