Problem 951. Unique: Faster for options 'rows' and 'stable' for large array of uint8
Challenge: Execute unique(a,'rows','stable') Faster for 'a' being uint8.
The "unique" function for the 'rows' and 'stable' options may be performed 10X more quickly for arrays of large rows, few columns, and uint8 (or values <256).
Output: unique(c,'rows','stable') or equivalent
Scoring: Time in milli-seconds
- unique can sort a single column >10X faster than an array of rows
- 10X improvement is applicable to arrays where rows can be represented as a uint32 value
- 5X improvement occurs where arrays require uint64 representation
Solution CommentsShow comments
Problem Recent Solvers20