• Sign in
  • Sign up 
  • Welcome
  • FAQ
  • Switch to Night Mode
  • Stolen Accounts Recovery 
  • Change Account Password 
  • Vote for Witnesses 
  • Steem Proposals 
  • Developer Portal 
  • Steem Bluepaper 
  • SMT Whitepaper 
  • Steem Whitepaper 
  • Privacy Policy
  • Terms of Service
Homeby Witness Moecki
LoginSign up
You are viewing a single comment's thread from:

RE: An Introduction to Time Complexity and Big O Notation

  • View the full context
  • View the direct parent
pynchon (34)in #computerscience • 7 years ago

yeah quicksort is n log n, I too dislike that chart's use of "bad"

7 years ago in #computerscience by pynchon (34)
$0.00
    Reply 0