lol wtf? If 'n' is the quantity of elements to be sorted there's no way you can write an algorithm with complexity O(n) for the worst case not knowing something special about the data.
For example, Quicksort will give you O(n*(log(n)) on average case (O(n^2) in the worst case). You gotta be much more specific than that if you really need an O(n) code. There's probably assumptions you didn't mention about the data if O(n) it's really what you're looking for. PS: Looks like a joke as stated.. ---------------------------------------- > Date: Fri, 24 May 2013 01:04:51 -0700 > Subject: help how to sort a list in order of 'n' in python without using > inbuilt functions?? > From: lokeshkopp...@gmail.com > To: python-list@python.org > > i need to write a code which can sort the list in order of 'n' without use > builtin functions > can anyone help me how to do? > -- > http://mail.python.org/mailman/listinfo/python-list > -- http://mail.python.org/mailman/listinfo/python-list
