排序算法: 冒泡排序，桶排序，计数排序，堆排序，插入排序，合并排序，快速排序，基数排序，选择排序，希尔排序 实现语言: C++

# 开源地址 [https://gitee.com/lblbc/simple-works/tree/master/sort/](https://gitee.com/lblbc/simple-works/tree/master/sort/) > 覆盖语言：C、C++、C#、Java、Kotlin、Dart、Go、JavaScript(JS)、TypeScript(TS)、ArkTS、swift、PHP。 > 覆盖平台：安卓(Java、Kotlin)、iOS(SwiftUI)、Flutter(Dart)、Window桌面(C#)、前端(微信小程序、uni-app、vue)、后端（Java、Kotlin、NodeJS、Python、PHP、Go、C、C++）、鸿蒙   # 1. 安卓Java版 开发工具：[下载Android Studio](https://cxyxy.blog.csdn.net/article/details/107098873) ```java public static void sort(int[] array) { int first = 0; int last = array.length - 1; mergeSort(array, first, last); } private static void mergeSort(int[] array, int first, int last) { if (first < last) { int mid = (first + last) / 2; mergeSort(array, first, mid); mergeSort(array, mid + 1, last); binaryMerge(array, first, mid, last); } } public static void binaryMerge(int[] array, int first, int mid, int last) { int[] tmpArray = new int[array.length]; int left, right, index; for (index = first; index <= last; index++) { tmpArray[index] = array[index]; } index = first; left = first; right = mid + 1; for (; left <= mid && right <= last && index <= last; index++) { if (tmpArray[left] <= tmpArray[right]) { array[index] = tmpArray[left++]; } else { array[index] = tmpArray[right++]; } } while (left <= mid) { array[index++] = tmpArray[left++]; } while (right <= last) { array[index++] = tmpArray[right++]; } } ```  # 2. 安卓Kotlin版 开发工具：[下载Android Studio](https://cxyxy.blog.csdn.net/article/details/107098873) ```kotlin fun sort(array: IntArray) { val first = 0 val last = array.size - 1 mergeSort(array, first, last) } private fun mergeSort(array: IntArray, first: Int, last: Int) { if (first < last) { val mid = (first + last) / 2 mergeSort(array, first, mid) mergeSort(array, mid + 1, last) binaryMerge(array, first, mid, last) } } fun binaryMerge(array: IntArray, first: Int, mid: Int, last: Int) { val tmpArray = IntArray(array.size) var left: Int var index = first while (index <= last) { tmpArray[index] = array[index] index++ } index = first.also { left = it } var right = mid + 1 while (left <= mid && right <= last && index <= last) { if (tmpArray[left] <= tmpArray[right]) { array[index] = tmpArray[left++] } else { array[index] = tmpArray[right++] } index++ } while (left <= mid) array[index++] = tmpArray[left++] while (right <= last) array[index++] = tmpArray[right++] } ```  # 3. NodeJS 开发工具：[下载Visual Studio Code](https://cxyxy.blog.csdn.net/article/details/128722652) ```js function sort() { let array = [2, 1, 5, 4, 3] var first = 0 var last = array.length - 1 mergeSort(array,first, last) } function mergeSort(array,first, last) { if (first < last) { var mid = Math.floor((first + last) / 2) mergeSort(array,first, mid) mergeSort(array,mid + 1, last) binaryMerge(array,first, mid, last) } } function binaryMerge(array,first, mid, last) { var tmpArray = Array(array.length).fill(0) var left, right, index for (index = first; index <= last; index++) { tmpArray[index] = array[index] } index = first left = first right = mid + 1 for (; left <= mid && right <= last && index <= last; index++) { if (tmpArray[left] <= tmpArray[right]) { array[index] = tmpArray[left++] } else { array[index] = tmpArray[right++] } } while (left <= mid) { array[index++] = tmpArray[left++] } while (right <= last) { array[index++] = tmpArray[right++] } } ```  # 4. Php 开发工具：[下载Visual Studio Code](https://cxyxy.blog.csdn.net/article/details/128722652) ```php public function sort() { $array = [2, 1, 5, 4, 3]; $start = 0; $end = count($array) - 1; $this->sortMe($array, $start, $end); return var_dump($array); } private function sortMe(&$arr, $start, $end) { if ($start < $end) { $mid = floor(($start + $end) / 2); $this->sortMe($arr, $start, $mid); $this->sortMe($arr, $mid + 1, $end); $this->mergeSort($arr, $start, $mid, $end); } } private function mergeSort(&$arr, $start, $mid, $end) { $i = $start; $j = $mid + 1; $tmp = []; while ($i <= $mid && $j <= $end) { if ($arr[$i] <= $arr[$j]) { $tmp[] = $arr[$i++]; } else { $tmp[] = $arr[$j++]; } } while ($i <= $mid) { $tmp[] = $arr[$i++]; } while ($j <= $end) { $tmp[] = $arr[$j++]; } for ($k = 0; $k < count($tmp); $k++) { $arr[$k + $start] = $tmp[$k]; } } ```  # 5. Python 开发工具：[下载PyCharm](https://cxyxy.blog.csdn.net/article/details/128722649) ```python array = [2, 1, 5, 4, 3] def merge(left, mid, right): start = mid - left + 1 end = right - mid left_arr = [0] * start right_arr = [0] * end for i in range(0, start): left_arr[i] = array[left + i] for j in range(0, end): right_arr[j] = array[mid + 1 + j] i = 0 j = 0 k = left while i < start and j < end: if left_arr[i] <= right_arr[j]: array[k] = left_arr[i] i += 1 else: array[k] = right_arr[j] j += 1 k += 1 while i < start: array[k] = left_arr[i] i += 1 k += 1 while j < end: array[k] = right_arr[j] j += 1 k += 1 def sort(left, right): if left < right: m = int((left + (right - 1)) / 2) sort(left, m) sort(m + 1, right) merge(left, m, right) ```  # 6. Swift(SwiftUI版) 开发工具：XCode(mac电脑自带) ```swift var array = [2, 1, 5, 4, 3] func sort() { sortMe(arr: &array, left: 0, right: array.count - 1) } func sortMe(arr:inout [Int],left:Int,right:Int) { if left == right { return } let mid = left + (right - left) >> 1 sortMe(arr: &arr, left: left, right: mid) sortMe(arr: &arr, left: mid + 1, right: right) mergeSort(arr: &arr, left: left, mid: mid, right: right) } func mergeSort(arr:inout [Int],left:Int,mid:Int,right:Int){ var tmpArr:[Int] = [Int]() var leftLocation:Int = left var rightLocation:Int = mid + 1 while (leftLocation <= mid && rightLocation <= right) { if arr[leftLocation] <= arr[rightLocation] { tmpArr.append(arr[leftLocation]) leftLocation += 1 }else{ tmpArr.append(arr[rightLocation]) rightLocation += 1 } } while leftLocation <= mid { tmpArr.append(arr[leftLocation]) leftLocation += 1 } while rightLocation <= right { tmpArr.append(arr[rightLocation]) rightLocation += 1 } var index = left