ÇóÖÚÊýµÄC³ÌÐò - C/C++ / CÓïÑÔ
¹òÇó£ºÇóÊý×éÖÐÖÚÊýµÄCÓïÑÔËã·¨£¬ÅÅÐòʱÓÿìËÙÅÅÐò
²»ÖªµÀÂ¥Ö÷˵µÄʲô¡£¡£¡£
ʲôÊÇÖÚÊý£¿£¿£¿
һЩÊýÖÐÏàͬµÄÊý×î¶àµÄÊý£¬±ÈÈç1 2 2 3µÄÖÚÊý¾ÍÊÇ2
ÏÈÅÅÐò£¬È»ºó¿ªÊ¼±éÀú£¬Èç¹ûµ±Ç°ÊýºÍÉϸöÊýÏàµÈ£¬¾ÍÔÚµ±Ç°Êý´ÎÊýÖÐ+1£¬Èç¹ûµ±Ç°Êý´ÎÊý´óÓÚ×î´ó´ÎÊý£¬¾Í°Ñ×î´ó´ÎÊý»»Îªµ±Ç°´ÎÊý¡¡¡¡¡¡
лл´ó¼Ò¹þ£¡ÓÈÆäÊÇ5Â¥µÄ~~~
²»¹ý£¬Èç¹ûÒ»¸öÊý×éÀïÃæ²»Ö»Ò»¸öÖÚÊýÄØ
±ÈÈç˵Êý×é1 2 3 1 2 3 2 3ÖУ¬2¸ú3¶¼ÊÇÖÚÊý
×î³õµÄÉè¼ÆÖ»ÓÐÒ»¸öÖÚÊýµÄÇé¿ö.
¸ÄһϴúÂë¾ÍokÁË¡£
C/C++ code:
#include<stdio.h>
/*¿ìËÙÅÅÐò*/
int quick_sort(int *a, int n, int left, int right) {
int s, i, j;
int temp;
if(left < right) {
s = a[left];
i = left;
j = right + 1;
while(1) {
while(i + 1 < n && a[++i] > s);
while(j - 1 > -1 && a[--j] < s);
if(i >= j) {
break;
}
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
a[left] = a[j];
a[j] = s;
quick_sort(a, n, left, j - 1);
quick_sort(a, n, j + 1, right);
}
return 0;
}
/*ÔÚÓÐÐòÊý×
Ïà¹ØÎÊ´ð£º
SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö
µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡
ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î
http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html
......
±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
RT£¡
C³ÌÐòÉè¼ÆÓïÑÔµÚ¶þ°æ
CºÍÖ¸Õë
CÏÝÚåÓëȱÏÝ
Cר¼Ò±à³Ì
ÖªµÀÕâËı¾¶¼ºÜÓмÛÖµ£¬µ«ÕâËı¾ÄÄÁ½±¾×îÖµµÃÉî¶ÁºÍÑо¿µÄ£¿ÎÒÏëÂòÖ½Öʵġ£»¹ÊÇÕâËı¾¶¼ÒªÂò£¿
Ò»±¾ÊéÏÈÑо¿Í¨ÁË×ãÒÔ£¬ÖªÊ¶µã¶¼ÊDz¶àµÄ£¬¹Ø¼ü¿´×Ô ......