那种网站打不开,网站 做 app,一般企业网站3年多少钱,wordpress搭建h52011年12月19日#xff0c;参考网上用C语言实现的快速排序#xff0c;经过一番修改后#xff0c;用shell(我的测试环境为centos5的bash-v3.x)实现了相同功能#xff1a;对数组进行升序排序。注#xff1a;如果代码框里的代码复制出来后显示异常#xff0c;就麻烦下载附件…2011年12月19日参考网上用C语言实现的快速排序经过一番修改后用shell(我的测试环境为centos5的bash-v3.x)实现了相同功能对数组进行升序排序。注如果代码框里的代码复制出来后显示异常就麻烦下载附件chris.zip(已将chris-qsort.sh和chris-algo.sh压缩打包为chris.zip)1. shell函数形式(已将其放在附件里文件名为chris-qsort.sh。由于没法上传.sh脚本故压缩打包了一下文件名为chris.zip)Quick_Sort(){#SortNumeric-arrayinASCorder, using normal Quick-Sort algorithm.#C code: http://www.cnblogs.com/skyaspnet/archive/2010/11/03/1868298.html#Usage: Quick_Sort lowest_index highest_index array_name#e.g., Quick_Sort 0 9 array1#e.g., Quick_Sort 1 3 array2localarray${3}evallocalpivot\$\{${array}[${1}]\}locallow${1}localhigh${2}[ ${1} -ge ${2} ] returnwhile [ ${low} -lt ${high} ]; dowhile [ ${low} -lt ${high} -a ${pivot} -le $(eval echo \$\{${array}[${high}]\}) ]; dolet high--doneif [ ${pivot} -gt $(eval echo \$\{${array}[${high}]\}) ];theneval ${array}[${low}]\$\{${array}[${high}]\}eval ${array}[${high}]${pivot}let lowfiwhile [ ${low} -lt ${high} -a ${pivot} -ge $(eval echo \$\{${array}[${low}]\}) ]; dolet lowdoneif [ ${pivot} -lt $(eval echo \$\{${array}[${low}]\}) ];theneval ${array}[${high}]\$\{${array}[${low}]\}eval ${array}[${low}]${pivot}let high--fidone#Executethe Quick_SortfunctionrecursivelyQuick_Sort ${1} $[${low}-1] ${array}Quick_Sort $[${low}1] ${2} ${array}unset array pivot low high}2. shell脚本形式进行简单测试(已将其放在附件里文件名为chris-algo.sh。由于没法上传.sh脚本故压缩打包了一下文件名为chris.zip)。#!/bin/bash#################################################### Author : Chris## CreateDate: 2011-12-19## ModifyDate: 2012-05-14## Realize common algorithms inbash-v3.x## Note: Every functionrepresents an algorithm.###################################################Normal Quick-Sort algorithmQuick_Sort(){#Sort Numeric-arrayinASCorder, using normal Quick-Sort algorithm.#C code: http://www.cnblogs.com/skyaspnet/archive/2010/11/03/1868298.html#Usage: Quick_Sort lowest_index highest_index array_name#e.g., Quick_Sort 0 9 array1#e.g., Quick_Sort 1 3 array2localarray${3}eval localpivot\$\{${array}[${1}]\}locallow${1}localhigh${2}[ ${1} -ge ${2} ] returnwhile [ ${low} -lt ${high} ]; dowhile [ ${low} -lt ${high} -a ${pivot} -le $(eval echo \$\{${array}[${high}]\}) ]; dolet high--doneif [ ${pivot} -gt $(eval echo \$\{${array}[${high}]\}) ]; theneval ${array}[${low}]\$\{${array}[${high}]\}eval ${array}[${high}]${pivot}let lowfiwhile [ ${low} -lt ${high} -a ${pivot} -ge $(eval echo \$\{${array}[${low}]\}) ]; dolet lowdoneif [ ${pivot} -lt $(eval echo \$\{${array}[${low}]\}) ]; theneval ${array}[${high}]\$\{${array}[${low}]\}eval ${array}[${low}]${pivot}let high--fidone#Executethe Quick_SortfunctionrecursivelyQuick_Sort ${1} $[${low}-1] ${array}Quick_Sort $[${low}1] ${2} ${array}unset array pivot low high}main(){read-epInput Numeric: numericsize$(echo ${numeric} | awk{print NF})#Define arrayt_array(${numeric})#Outputthe original arrayfor((i0;iprintf %d ${t_array[${i}]}doneprintf \n#Using Quick_Sort functiontosort t_arraysize_1$[${size} - 1]Quick_Sort 0 ${size_1} t_array#Outputthe sorted arrayfor((i0;iprintf %d ${t_array[${i}]}doneprintf \n}main输出如下[rootlocalhost algorithms]# ./chris-algo.sh49 38 65 97 76 13 27 9 2 11 2 9 13 27 38 49 65 76 97分享
