Skip to content
theAIcatchup
AI Business AI Ethics AI Hardware AI Research
AI Tools Computer Vision Large Language Models Robotics

#on2-complexity

ASCII bar chart of sorting algorithm runtimes in C for 1M integers

Bubble Sort Lasted 47 Seconds on 1M Ints — Counting Sort Blitzed It in 0.04: My C Benchmarks

Theory says O(n^2) is O(n^2). Practice laughs. My C benchmark clocked Bubble Sort at 47 seconds for a million ints — while Counting Sort flew by in 40 milliseconds.

5 min read 4 weeks, 1 day ago

Categories

AI Business AI Ethics AI Hardware AI Research AI Tools Computer Vision Large Language Models Robotics
theAIcatchup

AI news that actually matters.

More

  • RSS Feed
  • Sitemap
  • About
  • Editorial Process
  • Advertise

Legal

  • Privacy
  • Terms
  • Work With Us

Our Network

The AI Catchup AI & Machine Learning Threat Digest Cybersecurity Legal AI Beat Legal Tech Fintech Rundown Finance & Banking DevTools Feed Developer Tools Open Source Beat Open Source Fintech Dose Crypto & DeFi Chip Beat Semiconductors AdTech Beat Ad Technology Supply Chain Beat Logistics

© 2026 theAIcatchup. All rights reserved.

🏠Home 🔍Search 🔖Saved 📂Categories
Privacy & cookies

We use a privacy-respecting analytics tool to count page views — no personal profiles, no ad tracking, no third-party cookies. Accept to help us understand which stories matter to readers.

Details