https://github.com/bblanchon/timecomplexitylimits

Time-complexity benchmarks in C#
https://github.com/bblanchon/timecomplexitylimits

Last synced: 22 days ago
JSON representation

Time-complexity benchmarks in C#

• Host: GitHub
• URL: https://github.com/bblanchon/timecomplexitylimits
• Owner: bblanchon
• Created: 2014-05-03T19:21:00.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2014-05-03T19:21:18.000Z (over 10 years ago)
• Last Synced: 2024-05-02T00:54:26.657Z (7 months ago)
• Language: C#
• Size: 109 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Time-complexity benchmarks in C#

================================

A very small project to see what is the maximum problem size depending on the problem complexity.

### The results

Here is what my Core i5-2500 can do in 5 seconds:

| Time complexity | Maximum N |

| --------------- | --------- |

| O(1)            | Infinity  |

| O(log(n))       | Infinity  |

| O(n)            | 10^9      |

| O(n log(n))     | 10^8      |

| O(n^2)          | 10^4      |

| O(n^3)          | 10^3      |

| O(2^n)          | 30        |

| O(n!)           | 10        |

### Why ?

I needed that for my [Google Code Jam Cheat Sheet](http://blog.benoitblanchon.fr/google-code-jam-cheat-sheet/)