快速排序（QuickSort）用C# 实现的小例子

喜欢ヅ旅行 2022-12-20 01:49 12阅读 0赞

![731655954c7be9d8835ece551b5385f8.png][]

class  QuickSort

![24a924a57ba6b3f2b51fc9edb7ea4186.png][]

![9310e85a14af99de4811ff4c77f1f911.png][]

![222530190136c9c4cfd237cc0d5cff99.png][]

![1408c5260b2f05e450dee929db9be5f7.png][]

public void Sort(int\[\] data, int start, int end)

![715f2d05503b99d41f3b6ba2cdccc84d.png][]

![e083dfde5a91f50979fe8979b4012b9d.png][]

![222530190136c9c4cfd237cc0d5cff99.png][]

![1408c5260b2f05e450dee929db9be5f7.png][]

if (start >= end) return;

![1408c5260b2f05e450dee929db9be5f7.png][]

if (start + 1 == end)

![715f2d05503b99d41f3b6ba2cdccc84d.png][]

![e083dfde5a91f50979fe8979b4012b9d.png][]

![222530190136c9c4cfd237cc0d5cff99.png][]

![1408c5260b2f05e450dee929db9be5f7.png][]

if (data\[start\] > data\[end\])

![1408c5260b2f05e450dee929db9be5f7.png][]                    Swap(data, start, end);

![1408c5260b2f05e450dee929db9be5f7.png][]

return;

![5bcb1807ee3e00d2b3c225f0b3f5c751.png][]            \}

![1408c5260b2f05e450dee929db9be5f7.png][]

int indexL = start + 1, indexR = end;

![1408c5260b2f05e450dee929db9be5f7.png][]

while (indexL < indexR)

![715f2d05503b99d41f3b6ba2cdccc84d.png][]

![e083dfde5a91f50979fe8979b4012b9d.png][]

![222530190136c9c4cfd237cc0d5cff99.png][]

![1408c5260b2f05e450dee929db9be5f7.png][]

// Get from left

![1408c5260b2f05e450dee929db9be5f7.png][]

while (indexL <= end && data\[start\] >= data\[indexL\])

![1408c5260b2f05e450dee929db9be5f7.png][]                    indexL

\++;

![1408c5260b2f05e450dee929db9be5f7.png][]

// Get from right

![1408c5260b2f05e450dee929db9be5f7.png][]

while (indexR > start && data\[start\] < data\[indexR\])

![1408c5260b2f05e450dee929db9be5f7.png][]                    indexR

\--;

![1408c5260b2f05e450dee929db9be5f7.png][]

if (indexL < indexR)

![715f2d05503b99d41f3b6ba2cdccc84d.png][]

![e083dfde5a91f50979fe8979b4012b9d.png][]

![222530190136c9c4cfd237cc0d5cff99.png][]

![1408c5260b2f05e450dee929db9be5f7.png][]                    Swap(data, indexR, indexL);

![5bcb1807ee3e00d2b3c225f0b3f5c751.png][]                \}

![5bcb1807ee3e00d2b3c225f0b3f5c751.png][]            \}

![1408c5260b2f05e450dee929db9be5f7.png][]

if(indexL-1 !=start)

![1408c5260b2f05e450dee929db9be5f7.png][]                Swap(data, start, indexL

\- 1);

![1408c5260b2f05e450dee929db9be5f7.png][]

![1408c5260b2f05e450dee929db9be5f7.png][]            Sort(data, start, indexL

\- 2);

![1408c5260b2f05e450dee929db9be5f7.png][]            Sort(data, indexL, end);

![5bcb1807ee3e00d2b3c225f0b3f5c751.png][]        \}

![1408c5260b2f05e450dee929db9be5f7.png][]

private void Swap(int\[\] data, int x, int y)

![715f2d05503b99d41f3b6ba2cdccc84d.png][]

![e083dfde5a91f50979fe8979b4012b9d.png][]

![222530190136c9c4cfd237cc0d5cff99.png][]

![1408c5260b2f05e450dee929db9be5f7.png][]            data\[x\]

= data\[x\] + data\[y\];

![1408c5260b2f05e450dee929db9be5f7.png][]            data\[y\]

= data\[x\] - data\[y\];

![1408c5260b2f05e450dee929db9be5f7.png][]            data\[x\]

= data\[x\] - data\[y\];

![5bcb1807ee3e00d2b3c225f0b3f5c751.png][]        \}

![f466905a3bcb5dcef110eab799825254.png][]    \}

![731655954c7be9d8835ece551b5385f8.png][]

[731655954c7be9d8835ece551b5385f8.png]: /images/20221120/f11fbd600f9447e9934c4172158d9fd9.png
[24a924a57ba6b3f2b51fc9edb7ea4186.png]: /images/20221120/4240f3a2afd74d7b96f580b3bdf475a8.png
[9310e85a14af99de4811ff4c77f1f911.png]: /images/20221120/d35c382cb27245a68f30b7e016772d5e.png
[222530190136c9c4cfd237cc0d5cff99.png]: /images/20221120/e0ee92c1c90d48d4b9bb08e6e680e09b.png
[1408c5260b2f05e450dee929db9be5f7.png]: /images/20221120/c9dee8924058499ca292e810339abdc6.png
[715f2d05503b99d41f3b6ba2cdccc84d.png]: /images/20221120/ba16fca81e17461a87180f5a37f7e0da.png
[e083dfde5a91f50979fe8979b4012b9d.png]: /images/20221120/6c9b191cb52a47699b61a302749d5c34.png
[5bcb1807ee3e00d2b3c225f0b3f5c751.png]: /images/20221120/e57e19ea9d7f4371a9c977c9a2e6ccb7.png
[f466905a3bcb5dcef110eab799825254.png]: https://img-blog.csdnimg.cn/img_convert/f466905a3bcb5dcef110eab799825254.png