第二章之“選擇排序”

來源:互聯網
上載者:User
#include <stdio.h>#include <string.h>#include <time.h>#define BUFFER_SIZE 10 void SelectionSort(int *a,int len){int i=0;int j=0;int min=0;int temp=0;for(j=0;j<len-1;j++){min=a[j]; for(i=j+1;i<len;i++){if(min>a[i]){temp=a[i];a[i]=min;min=temp;}}a[j]=min;}}void Output(int *a,int len){int i=0;for(i=0;i<len;i++){printf("%d ",a[i]);}printf("\n");}int main(){    int i=0;int a[BUFFER_SIZE];memset(a,0,sizeof(a));srand((unsigned)time(NULL));for(i=0;i<BUFFER_SIZE;i++){a[i]=rand()%BUFFER_SIZE;}    Output(a,BUFFER_SIZE);SelectionSort(a,BUFFER_SIZE);Output(a,BUFFER_SIZE);system("pause");}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.