ÇóÖÚÊýµÄ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;
}
/*ÔÚÓÐÐòÊý×
Ïà¹ØÎÊ´ð£º
дÁ˸ö²âÊÔ³ÌÐòÈçÏÂ
struct hostent *hp;
char AlarmDevIP[20];
int x2;
hp = gethostbyname("www.google.com");
if (hp)
{
......
ÓÐÒ»10*10¾ØÕ󣬳ýÈ¥µÚÒ»¸öµã£¨0£¬0£©ºÍ×îºóÒ»µã£¨9£¬9£©£¬»¹Óа˸öµãΪ1£¬ÆäËû¶¼Îª0£¬ÒªÇóÓöþάÊý×é±íʾ¡£°Ë¸öµãÊÇËæ»úÉú³ÉµÄ£¬±àдÏà¹Ø³ÌÐò±íʾ¾ØÕóËùÓпÉÄÜÇé¿ö¡£
ÕæÐÄÇó½Ì¸÷λ¸ßÊÖ£¬°¥£¡±¾ÈËÌ«²ËÁË£¡ºÇºÇ£¡
......
ÔÚ¸ùĿ¼/libÖдæ·ÅÒ»¸ölog.c£¬log.h£¬²¢ÓÃÏÂÃæµÄÓï¾ä£º
gcc -c log.c
ar crv liblog.a log.o
±àÒë³öÒ»¸öliblog.a¾²Ì¬¿â£¬È»ºóÔÚÎļþ¼Ð£º/testfileÖд´½¨Ò»¸ötest.cºÍtestc.c£¬test.cÖÐÒýÓÃÁËtestc.cÖж¨ÒåµÄ·½·¨ ......
ΪʲôÎҵijÌÐòµ÷ÓÃXMLÅäÖÃÎļþÖеİ¢À²®ÎÄÏÔʾ²»³öÀ´£¿ÆäËûµÄÓïÖÖ¶¼¿ÉÒÔ£¬ÈçÖÐÎÄ£¬Ó¢ÎÄ£¬µÂÎͼ¿É¡£
ÎÒ½«XMLµÄ±àÂë¸ÄΪutf-8ºÍunicodeµÄµ½µÃ½á¹û¶¼Ò»Ñù.
°¢À²®ÎĵÄ×Ö¿âÄãÓÐô£¿
ÓÐ,ÎÒµÄEXEÊÇ·ÅÔÚpc»úÉÏÖ´Ðе ......