linux bash shell实现对数组快速排序（升序）

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(){  
    #Sort Numeric-array in ASC order, 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 array2  
 
    local array=${3}  
    eval local pivot=\$\{${array}[${1}]\}  
    local low=${1}  
    local high=${2}  
 
    [ ${1} -ge ${2} ] && return 
 
    while [ ${low} -lt ${high} ]; do  
        while [ ${low} -lt ${high} -a ${pivot} -le $(eval echo \$\{${array}[${high}]\}) ]; do  
            let high--  
        done  
        if [ ${pivot} -gt $(eval echo \$\{${array}[${high}]\}) ]; then 
            eval ${array}[${low}]=\$\{${array}[${high}]\}  
            eval ${array}[${high}]=${pivot}  
            let low    
        fi  
 
        while [ ${low} -lt ${high} -a ${pivot} -ge $(eval echo \$\{${array}[${low}]\}) ]; do  
            let low    
        done  
        if [ ${pivot} -lt $(eval echo \$\{${array}[${low}]\}) ]; then 
            eval ${array}[${high}]=\$\{${array}[${low}]\}  
            eval ${array}[${low}]=${pivot}  
            let high--  
        fi  
    done  
 
    #Execute the Quick_Sort function recursively  
    Quick_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  
## Create Date:  2011-12-19  
## Modify Date:  2011-12-19  
## Realize common algorithms in bash-v3.x  
## Note: Every function represents an algorithm.  
##################################################  
 
#Normal Quick-Sort algorithm  
Quick_Sort(){  
    #Sort Numeric-array in ASC order, 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 array2  
 
    local array=${3}  
    eval local pivot=\$\{${array}[${1}]\}  
    local low=${1}  
    local high=${2}  
 
    [ ${1} -ge ${2} ] && return 
 
    while [ ${low} -lt ${high} ]; do  
        while [ ${low} -lt ${high} -a ${pivot} -le $(eval echo \$\{${array}[${high}]\}) ]; do  
            let high--  
        done  
        if [ ${pivot} -gt $(eval echo \$\{${array}[${high}]\}) ]; then 
            eval ${array}[${low}]=\$\{${array}[${high}]\}  
            eval ${array}[${high}]=${pivot}  
            let low    
        fi  
 
        while [ ${low} -lt ${high} -a ${pivot} -ge $(eval echo \$\{${array}[${low}]\}) ]; do  
            let low    
        done  
        if [ ${pivot} -lt $(eval echo \$\{${array}[${low}]\}) ]; then 
            eval ${array}[${high}]=\$\{${array}[${low}]\}  
            eval ${array}[${low}]=${pivot}  
            let high--  
        fi  
    done  
 
    #Execute the Quick_Sort function recursively  
    Quick_Sort ${1} $[${low}-1] ${array}  
    Quick_Sort $[${low} 1] ${2} ${array}  
 
    unset array pivot low high  
}  
 
main(){  
    #Define array  
    t_array=(49 38 65 97 76 13 27 9 2 1)  
 
    #Output the original array  
    for((i=0;i<10;i  )); do  
        printf "%d " ${t_array[${i}]}  
    done  
    printf "\n" 
 
    #Using Quick_Sort function to sort t_array  
    Quick_Sort 0 9 t_array  
 
    #Output the sorted array  
    for((i=0;i<10;i  )); do  
        printf "%d " ${t_array[${i}]}  
    done  
    printf "\n" 
}  
 
main  

凌众科技专业提供服务器租用、服务器托管、企业邮局、虚拟主机等服务，公司网站：http://www.lingzhong.cn 为了给广大客户了解更多的技术信息，本技术文章收集来源于网络,凌众科技尊重文章作者的版权，如果有涉及你的版权有必要删除你的文章，请和我们联系。以上信息与文章正文是不可分割的一部分,如果您要转载本文章,请保留以上信息，谢谢!