-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
快排算法实现 #5
Comments
快速排序是不稳定的排序算法,平均时间复杂度为 O(nlogn) ,最好情况下为 O(nlogn),最差情况下为 O(n^2)。另外,快速排序算法实现上还是递归的方式,在无法实现尾递归优化的情况下还是存在调用栈溢出的可能,因此不能进行大量数据的排序。 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
排序思路(从小到大):
The text was updated successfully, but these errors were encountered: