[Sort Algorithm]
一刀不二
这个作者很懒,什么都没留下…
展开
-
POJ 2785 A Values whose Sum is 0 ( 拆合+排序+二分 )
#include #include #include using namespace std;#define MAXN 4010int A[MAXN];int B[MAXN];int C[MAXN];int D[MAXN];int CD[MAXN * MAXN];int main(){ int n; long long res = 0; ci原创 2014-10-22 18:13:31 · 623 阅读 · 0 评论 -
一行代码的快速排序
很和谐精悍的一行快排代码quicksort1。import randomdef quicksort( list ): if list == []: return [] else: cut = list[0] lesser = quicksort( [ x for x in list[1:] if x < cut ]原创 2014-05-21 11:51:58 · 2152 阅读 · 0 评论 -
Scheme 快速排序
#!r6rs( import ( rnrs base ( 6 ) ) )( define ( filter pred items ) ( cond [ ( null? items ) '() ] [ ( pred ( car items ) ) ( cons ( car items )原创 2014-08-02 00:12:05 · 2569 阅读 · 0 评论 -
鸡尾酒排序
def cocktail_sort( arr ): arr_len = len( arr ) half = arr_len / 2 for i in xrange( half ): for j in xrange( i, arr_len - i - 1 ): if arr[j] > arr[1 + j]:原创 2014-11-20 17:46:11 · 1291 阅读 · 0 评论 -
归并排序
#lang scheme( define ( list-len lst ) ( cond [ ( null? lst ) 0 ] [ else ( + 1 ( list-len ( cdr lst ) ) ) ] ) )( define ( left-branch lst len ) ( cond [ ( = len 0原创 2015-03-19 15:27:23 · 484 阅读 · 0 评论