For large arrays, you need an efficient sorting technique. One of the most efficient techniques is the QUICK SORT. The quick sort technique takes the middle element of an array and sub-divides the array into two smaller arrays. One array will contain elements greater than the middle value of the ORIGINAL array. Conversely, the other array will contain elements that are less than the middle value. The quick sort will repeat this process for each new array until the FINAL arrays contain only a single element. At this point, the single element arrays are in the proper ORDER, as shown below

For large arrays, you need an efficient sorting technique. One of the most efficient techniques is the quick sort. The quick sort technique takes the middle element of an array and sub-divides the array into two smaller arrays. One array will contain elements greater than the middle value of the original array. Conversely, the other array will contain elements that are less than the middle value. The quick sort will repeat this process for each new array until the final arrays contain only a single element. At this point, the single element arrays are in the proper order, as shown below