算法原理就不用过多介绍了,直接上代码:
using System.Collections;
using System.Collections.Generic;
using UnityEngine;
public class Sort : MonoBehaviour
{
List<int> nums = new List<int> {
2, 6, 7, 1, 45, 23, 14, 64, 22 };
// Start is called before the first frame update
void Start()
{
//MaoPaoSort(nums);
//XuanZeSort(nums);
//ChaRuSort(nums);
//QuickSort(nums, 0, nums.Count-1);
/*foreach (var item in nums)
{
Debug.Log(item);
}*/
}
//快速排序
void QuickSort(List<int> lists,int low,int high)
{
if (low