Time for action – partial sorting via selection for a fast median with the partition() function
The partition() function does partial sorting, which should be faster than full sorting, because it's less work.
Note
For more information, please refer to http://en.wikipedia.org/wiki/Partial_sorting. A common use case is getting the top 10 elements of a collection. Partial sorting doesn't guarantee the correct order within the group of top elements itself.
The first argument of the function is the array to partially sort. The second argument is an integer or a sequence of integers corresponding to indices of array elements. The partition() function sorts elements in those indices correctly. With one specified index, we get two partitions; with multiple ...
Get NumPy : Beginner's Guide - Third Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
