• Home

General

• Ruby Kickstart
• F/OSS
• Personal Projects
• Sort Algorithm Videos
• Game of Life

Gems

• Seeing Is Believing
• Surrogate
• Mountain Berry Fields
• Deject
• Pbcopy
• LetterPress Is Not As Good As Boggle
• Haiti

Web Based

• NetCredit
• Westlink
• CS Library
• Land of Lisp DSL

Sort Time Complexity

graphing big O times with the growth of n

A short project to see the difference in time complexities for various Big O notation algorithms. It's written in C, and compares insertion sort to merge sort.

Check out the code.