Skip to content

Navigation Menu

Explore
By company size
By use case
By industry
View all solutions
Topics
- AI
- DevOps
- Security
- Software Development
- View all
Explore
- GitHub Sponsors
  Fund open source developers
- The ReadME Project
  GitHub community articles
Repositories
- Enterprise platform
  AI-powered developer platform
Available add-ons
Pricing

Search code, repositories, users, issues, pull requests...

Search

Clear

Search syntax tips

Provide feedback

We read every piece of feedback, and take your input very seriously.

Include my email address so I can be contacted

Saved searches

Use saved searches to filter your results more quickly

Name

Query

To see all available qualifiers, see our documentation.

You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session.

Dismiss alert

swenson / sort Public

Notifications You must be signed in to change notification settings
Fork 88
Star 465

Code
Issues 4
Pull requests 1
Actions
Projects
Wiki
Security
Insights

Additional navigation options

Code
Issues
Pull requests
Actions
Projects
Wiki
Security
Insights

Add quick sort manual tail-call optimization#63

Merged

swenson merged 3 commits intomasterswenson/sort:masterfrom quick-improvementsswenson/sort:quick-improvementsCopy head branch name to clipboard

Sep 21, 2019

+99-24

Conversation Commits3 (3)Checks Files changed

Commits

Commits on Sep 21, 2019

Add quick sort manual tail-call optimization
swenson
committed
Use simpler evil data generation algorithm (thanks @Baobaobear !)
swenson
committed
Quick sort: Lomuto partitioning, 5-median, TCO, heap sort
swenson
committed

Footer

© 2025 GitHub, Inc.

Footer navigation

Terms
Privacy
Security
Status
Docs
Contact

You can’t perform that action at this time.