void __fileDECL qsort (
成都創(chuàng)新互聯(lián)公司服務(wù)項(xiàng)目包括廣漢網(wǎng)站建設(shè)、廣漢網(wǎng)站制作、廣漢網(wǎng)頁制作以及廣漢網(wǎng)絡(luò)營銷策劃等。多年來，我們專注于互聯(lián)網(wǎng)行業(yè)，利用自身積累的技術(shù)優(yōu)勢(shì)、行業(yè)經(jīng)驗(yàn)、深度合作伙伴關(guān)系等，向廣大中小型企業(yè)、政府機(jī)構(gòu)等提供互聯(lián)網(wǎng)行業(yè)的解決方案，廣漢網(wǎng)站推廣取得了明顯的社會(huì)效益與經(jīng)濟(jì)效益。目前，我們服務(wù)的客戶以成都為中心已經(jīng)輻射到廣漢省份的部分城市，未來相信會(huì)繼續(xù)擴(kuò)大服務(wù)區(qū)域并繼續(xù)獲得客戶的支持與信任！
void *base,
size_t num,
size_t width,
int (__fileDECL *comp)(const void *, const void *)
)
#endif /* __USE_CONTEXT */
{
char *lo, *hi; /* ends of sub-array currently sorting */
char *mid; /* points to middle of subarray */
char *loguy, *higuy; /* traveling pointers for partition step */
size_t size; /* size of the sub-array */
char *lostk[STKSIZ], *histk[STKSIZ];
int stkptr; /* stack for saving sub-array to be processed */
/* validation section */
_VALIDATE_RETURN_VOID(base != NULL || num == 0, EINVAL);
_VALIDATE_RETURN_VOID(width 0, EINVAL);
_VALIDATE_RETURN_VOID(comp != NULL, EINVAL);
if (num 2)
return; /* nothing to do */
stkptr = 0; /* initialize stack */
lo = (char *)base;
hi = (char *)base + width * (num-1); /* initialize limits */
/* this entry point is for pseudo-recursion calling: setting
lo and hi and jumping to here is like recursion, but stkptr is
preserved, locals aren't, so we preserve stuff on the stack */
recurse:
size = (hi - lo) / width + 1; /* number of el's to sort */
/* below a certain size, it is faster to use a O(n^2) sorting method */
if (size = CUTOFF) {
__SHORTSORT(lo, hi, width, comp, context);
}
else {
/* First we pick a partitioning element. The efficiency of the
algorithm demands that we find one that is approximately the median
of the values, but also that we select one fast. We choose the
median of the first, middle, and last elements, to avoid bad
performance in the face of already sorted data, or data that is made
up of multiple sorted runs appended together. Testing shows that a
median-of-three algorithm provides better performance than simply
picking the middle element for the latter case. */
mid = lo + (size / 2) * width; /* find middle element */
/* Sort the first, middle, last elements into order */
if (__COMPARE(context, lo, mid) 0) {
swap(lo, mid, width);
}
if (__COMPARE(context, lo, hi) 0) {
swap(lo, hi, width);
}
if (__COMPARE(context, mid, hi) 0) {
swap(mid, hi, width);
}
/* We now wish to partition the array into three pieces, one consisting
of elements = partition element, one of elements equal to the
partition element, and one of elements than it. This is done
below; comments indicate conditions established at every step. */
loguy = lo;
higuy = hi;
/* Note that higuy decreases and loguy increases on every iteration,
so loop must terminate. */
for (;;) {
/* lo = loguy hi, lo higuy = hi,
A[i] = A[mid] for lo = i = loguy,
A[i] A[mid] for higuy = i hi,
A[hi] = A[mid] */
/* The doubled loop is to avoid calling comp(mid,mid), since some
existing comparison funcs don't work when passed the same
value for both pointers. */
if (mid loguy) {
do {
loguy += width;
} while (loguy mid __COMPARE(context, loguy, mid) = 0);
}
if (mid = loguy) {
do {
loguy += width;
} while (loguy = hi __COMPARE(context, loguy, mid) = 0);
}
/* lo loguy = hi+1, A[i] = A[mid] for lo = i loguy,
either loguy hi or A[loguy] A[mid] */
do {
higuy -= width;
} while (higuy mid __COMPARE(context, higuy, mid) 0);
/* lo = higuy hi, A[i] A[mid] for higuy i hi,
either higuy == lo or A[higuy] = A[mid] */
if (higuy loguy)
break;
/* if loguy hi or higuy == lo, then we would have exited, so
A[loguy] A[mid], A[higuy] = A[mid],
loguy = hi, higuy lo */
swap(loguy, higuy, width);
/* If the partition element was moved, follow it. Only need
to check for mid == higuy, since before the swap,
A[loguy] A[mid] implies loguy != mid. */
if (mid == higuy)
mid = loguy;
/* A[loguy] = A[mid], A[higuy] A[mid]; so condition at top
of loop is re-established */
}
/* A[i] = A[mid] for lo = i loguy,
A[i] A[mid] for higuy i hi,
A[hi] = A[mid]
higuy loguy
implying:
higuy == loguy-1
or higuy == hi - 1, loguy == hi + 1, A[hi] == A[mid] */
/* Find adjacent elements equal to the partition element. The
doubled loop is to avoid calling comp(mid,mid), since some
existing comparison funcs don't work when passed the same value
for both pointers. */
higuy += width;
if (mid higuy) {
do {
higuy -= width;
} while (higuy mid __COMPARE(context, higuy, mid) == 0);
}
if (mid = higuy) {
do {
higuy -= width;
} while (higuy lo __COMPARE(context, higuy, mid) == 0);
}
/* OK, now we have the following:
higuy loguy
lo = higuy = hi
A[i] = A[mid] for lo = i = higuy
A[i] == A[mid] for higuy i loguy
A[i] A[mid] for loguy = i hi
A[hi] = A[mid] */
/* We've finished the partition, now we want to sort the subarrays
[lo, higuy] and [loguy, hi].
We do the smaller one first to minimize stack usage.
We only sort arrays of length 2 or more.*/
if ( higuy - lo = hi - loguy ) {
if (lo higuy) {
lostk[stkptr] = lo;
histk[stkptr] = higuy;
++stkptr;
} /* save big recursion for later */
if (loguy hi) {
lo = loguy;
goto recurse; /* do small recursion */
}
}
else {
if (loguy hi) {
lostk[stkptr] = loguy;
histk[stkptr] = hi;
++stkptr; /* save big recursion for later */
}
if (lo higuy) {
hi = higuy;
goto recurse; /* do small recursion */
}
}
}
/* We have sorted the array, except for any pending sorts on the stack.
Check if there are any, and do them. */
--stkptr;
if (stkptr = 0) {
lo = lostk[stkptr];
hi = histk[stkptr];
goto recurse; /* pop subarray from stack */
}
else
return; /* all subarrays done */
}
標(biāo)準(zhǔn)庫只是定義接口，具體怎么實(shí)現(xiàn)就得看操作系統(tǒng)，你說win下和linux下這些函數(shù)的實(shí)現(xiàn)會(huì)一樣嗎。當(dāng)然不一樣，看這些學(xué)源碼，不如看看c標(biāo)準(zhǔn)，c89或c99.
那可以看內(nèi)核，看系統(tǒng)調(diào)用是怎么樣實(shí)現(xiàn)的，你說的那些都是基于系統(tǒng)調(diào)用的
有安裝vs2008或2010嗎，在安裝目錄下面的VC/src中自帶有源代碼。比如我的就在
D:\Program Files\Microsoft Visual Studio 10.0\VC\crt\src中。沒有的話發(fā)給你
如果網(wǎng)頁嫌麻煩，可以先裝git，然后
git clone git://sourceware.org/git/glibc.git
cd glibc
git checkout --track -b glibc-2_11-branch origin/release/2.11/master
其實(shí)完全沒有必要全都看，無論你有沒有這個(gè)能力。因?yàn)橛捎跉v史兼容等問題，C標(biāo)準(zhǔn)庫的代碼并不是很適合學(xué)習(xí)，里面有些很雜亂。不過看過肯定比沒看好，畢竟都是牛人寫的。
望采納，謝謝
如果你安裝的Visual Studio，以及它的Visual C++的話，
那么在安裝目錄下的VC/crt/src下有所有標(biāo)準(zhǔn)C庫的源代碼
另外，h后綴的頭文件包含函數(shù)的聲明，具體的實(shí)現(xiàn)都在c后綴的源碼文件中
1、首先標(biāo)準(zhǔn)只是規(guī)定了這些函數(shù)的接口和具體的運(yùn)行效率的要求，這些函數(shù)具體是怎么寫得要看各個(gè)編譯器的實(shí)現(xiàn)和平臺(tái)。
2、例如使用的編譯器是visual studio，微軟提供了一部分C運(yùn)行時(shí)(CRT)的源碼，里面會(huì)有memcpy，strcpy之類的函數(shù)的實(shí)現(xiàn)，在visual studio 2005下的路徑是C:\Program Files\Microsoft Visual Studio 8\VC\crt\src。
C語言
C語言是一門通用計(jì)算機(jī)編程語言，應(yīng)用廣泛。C語言的設(shè)計(jì)目標(biāo)是提供一種能以簡易的方式編譯、處理低級(jí)存儲(chǔ)器、產(chǎn)生少量的機(jī)器碼以及不需要任何運(yùn)行環(huán)境支持便能運(yùn)行的編程語言。
重慶分公司
重慶分公司
