using System.Collections;
using System.Collections.Generic;
using UnityEngine;
public class Arithmetic : MonoBehaviour
{
private int[] arr = new int[] {
5, 7, 9, 3, 1, 0, 6, 4, 2, 8 };
private 快速 _Get = new 快速();
void Start()
{
//_Get.快速排序方法1(arr, 0, arr.Length - 1);
插入排序(arr);
}
/// <summary>
/// 时间复杂度为o(n2次方),空间复杂度为o(1),他是稳定的
/// </summary>
/// <param name="arr"></param>
private void 冒泡排序(int[] arr)
{
int test = 0;
for (int i = 0; i < arr.Length-1; i++)
{
for (int j = 0; j < arr.Length-1-i; j++)
{
if(arr[j]>arr[j+1])
{
test = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = test;
}
}
}
for (
c#算法时间复杂度 面试必看
最新推荐文章于 2024-07-24 20:53:03 发布