WEB开发网      濠电娀娼ч崐濠氬疾椤愶附鍋熸い鏍ㄧ〒闂勫嫰鏌﹀Ο渚Ц闁诲氦顕ч湁婵犲﹤楠告禍鍓х磼鏉堛劌绗氶柟宄版嚇閹晠宕归銈嗘濠电偞鍨堕幐鎾磻閹捐秮褰掓偐閻戞﹩妫勯梺鎼炲妼鐎涒晝绮嬪澶樻晝闁挎繂鏌婇敃鍌涚厵閻庢稒锚閻忥絾绻濇繝鍐ㄧ伌闁诡垰鍟村畷鐔碱敂閸♀晙绱樺┑鐐差嚟婵儳螞閸曨剚鍙忛柍鍝勬噹缁€澶嬬箾閹存繄锛嶆鐐灲閹綊宕惰濡插鏌涢妸銉ヮ劉缂佸倸绉归弫鎾绘晸閿燂拷 ---闂備焦瀵уú鈺呭箯閿燂拷
开发学院软件开发C++ a program a day 21(ds,bubble sort) 阅读

a program a day 21(ds,bubble sort)

 2010-10-17 08:05:02 来源:WEB开发网 闂備線娼уΛ鎾箯閿燂拷闂備礁鎲¢崹鐢垫崲閹扮増鍎嶆い鎺戝€甸崑鎾斥槈濞嗗秳娌紓鍌氱▌閹凤拷濠电姭鎷冮崨顓濈捕闂侀潧娲ゅú銊╁焵椤掍胶鈯曢柕鍥╁仧缁辩偤鏁撻敓锟�闂備線娼уΛ鎾箯閿燂拷  闂備胶枪缁绘鈻嶉弴銏犳瀬闁绘劕鎼痪褔鏌曟繝蹇曠窗闁煎壊浜滈—鍐偓锝庡墮娴犙勭箾閸喎鐏ユい鏇樺劦椤㈡瑩鎮℃惔銇帮拷
核心提示:/***bubble Sort**/#define keyType int#include<stdio.h>//base bubble sort int bubbleSort(keyType array[],int n){ keyType tmp; for(int i = 1;i <= n-1;i++
/**
*bubble Sort
**/
#define keyType int
#include<stdio.h>
//base bubble sort 
int bubbleSort(keyType array[],int n)
{
 keyType tmp;
 for(int i = 1;i <= n-1;i++)
 {
  for(int j = 0;j < n-i;j++)
  {
   if(array[j] > array[j+1])
   {
    tmp = array[j];
    array[j] = array[j+1];
    array[j+1] = tmp;
   }
  }
 }
 return 0;
}
//advanced bubble sort
int adBubSort(keyType array[],int n)
{
 keyType tmp;
 int tag = 1;
 for(int i = 1;i <= n-1 && 1 == tag;i++)// if tag is not set then the array is already orderly.
 {
     tag = 0;
  for(int j = 0;j < n-i;j++)
  {
   if(array[j] > array[j+1])
   {
    tmp = array[j];
    array[j] = array[j+1];
    array[j+1] = tmp;
    tag = 1;
   }
  }
 }
 return 0;
}
int main()
{
 keyType arr[10] = {6,4,72,10,4,51,23,100,47,0};
 printf("the array before sorted is :\n");
 for(int i = 0;i < 10;i++)
    printf("%d ",arr[i]);
 adBubSort(arr,10);
    printf("\nthe result of insertion sorting is :\n");
 for(int j = 0;j < 10;j++)
    printf("%d ",arr[j]);
 printf("\n");
 return 0;
}

Tags:program day ds

编辑录入:爽爽 [复制链接] [打 印]
赞助商链接