随笔分类 - 排序算法
摘要:#!/usr/bin/env python # -*- coding: utf-8 -*- def heap_sort(arr): l = len(arr) for i in xrange(l/2, -1, -1): form_heap(arr, i, l-1) for i in xrange(l-1, 0, -1): arr[i],ar...
阅读全文
摘要:#!/usr/bin/env python # -*- coding: utf-8 -*- def insert_sort(arr): l = len(arr) - 1 for i in xrange(1, l): for j in xrange(i, 0, -1): if arr[j] < arr[j-1]: ...
阅读全文
摘要:#!/usr/bin/env python # -*- coding: utf-8 -*- #插入排序,缩小增量 def shell_sort(arr): gap = l = len(arr) while(gap > 1): gap = gap/2 for i in xrange(gap, l): for j in xran...
阅读全文
摘要:#!/usr/bin/env python # -*- coding: utf-8 -*- #冒泡排序 def bubble_sort(arr): l = len(arr) - 1 for i in xrange(0, l): flag = True for j in xrange(0, l - i): if arr[j]...
阅读全文
摘要:#!/usr/bin/env python # -*- coding: utf-8 -*- #插入排序,缩小增量 def shell_sort(arr): gap = l = len(arr) while(gap > 1): gap = gap/2 for i in xrange(0, l): for j in xrange...
阅读全文
摘要:#!/usr/bin/env python # -*- coding: utf-8 -*- def quick_sort(arr): l = len(arr) _quick_sort(arr, 0, l -1) tmp = 0 def _quick_sort(arr, start, end): print start,end if start >= end: ...
阅读全文
摘要:function quick_sort(&$arr) { _quick_sort($arr, 0, count($arr) - 1); } function _quick_sort(&$arr, $start, $end) { if ($start >= $end) { return; } #$middle = partition($arr, $s...
阅读全文
摘要:1 $arr = [9, 43, 12, 0, 87, 1]; 2 function merge_sort(&$arr){ 3 _merge_sort($arr, $arr, 0, count($arr) - 1); 4 } 5 6 function _merge_sort(&$s_arr, &$d_arr, $i, $j){ 7 if($i > $j){ 8 ...
阅读全文
摘要://shell排序配插入排序function shell_insert_sort(arr){ var gap = arr.length; do{ gap = parseInt(gap/3) + 1; console.log(gap); for(var i = gap; i < arr.length;
阅读全文
摘要:function bubble_sort1(arr){ var flag = true; for(var i = 0; i < arr.length && flag; i++){ flag = false; console.log(arr); for(var j = 1; j < arr.lengt
阅读全文
摘要:function quick_sort(arr){ _quick_sort(arr, 0, arr.length -1); } function _quick_sort(arr, start, end){ if(start < end){ var middle = _quick(arr, start
阅读全文

浙公网安备 33010602011771号