29 Jan
2015
29 Jan
'15
7:57 p.m.
It sounds like np.partition could be used to answer the question: give me the highest K elements in a vector. Is this a correct interpretation? Something like partial sort, but returned elements are unsorted. I could really make some use of this, but in my case it is a list of objects I need to sort on a particular key. Is this algorithm available in general python code (not specific to numpy arrays)? -- -- Those who don't understand recursion are doomed to repeat it