zoukankan      html  css  js  c++  java
  • 排序

    <?php

    //插入排序

    function insertSort($arr){
    //检测数组
    $len = count($arr);
    if($len < 2){
    return $arr;
    }

    $sign = 1;
    $sortArr = array();
    foreach($arr as $key=>$value){
    if(1 === $sign){
    $sign = 2;
    $sortArr[$key] = $value;
    }else{

    $tmpArr = array();
    $end = count($sortArr);
    $j = 0;
    foreach($sortArr as $k=>$v){
    $j++;
    if($value < $v){
    $tmpArr[$key] = $value;
    $tmpArr[$k] = $v;
    }else{
    $tmpArr[$k] = $v;
    }
    }
    if($j == $end){
    $tmpArr[$key] = $value;
    }
    $sortArr = $tmpArr;
    }

    }
    return $sortArr;
    }

    $arr = array('a'=>1, 'b'=>9, 'c'=>5, 'd'=>12, 'e'=>2, 'f'=>6);

    var_dump($arr);
    var_dump(insertSort($arr));

  • 相关阅读:
    python反射
    numpy笔记
    leetcode43
    leetcode-42
    The Github Flow
    leetcode-37
    leetcode-41
    leetcode-40
    TCP扫盲2
    字节码分析与操作
  • 原文地址:https://www.cnblogs.com/persist/p/3268358.html
Copyright © 2011-2022 走看看