User talk:MichaelChrisco: Difference between revisions
Content added Content deleted
m (newLISP non-working impl. (work in progress)) |
m (O(2n) complexity not O(n) in this case) |
||
Line 14: | Line 14: | ||
//this algorithm only works with positive, whole numbers. It can be made to work with other numbers but the performance would be horrific. |
//this algorithm only works with positive, whole numbers. It can be made to work with other numbers but the performance would be horrific. |
||
//its a proof of concept. For actual sorting, it probably has worse time and space complexity than some algorithms. |
//its a proof of concept. For actual sorting, it probably has worse time and space complexity than some algorithms. |
||
//O( |
//O(2n) time complexity where n is the summation of the whole list to be sorted. |
||
//O(3n) space complexity. There are three lists that I created. 2 on the fly. |
//O(3n) space complexity. There are three lists that I created. 2 on the fly. |
||