HF RL Explorer

Task: Implement a Fast Method to Find the Largest N Elements in a NumPy Array

Task: Implement a Fast Method to Find the Largest N Elements in a NumPy Array: a task in Terminal-Lego-15k (Harbor dataset). You need to implement an efficient method to find the largest N elements in a NumPy array. The naive approach using np.argsort() -N: performs a full sort with O(n log n)…

Part of PrimeIntellect/Terminal-Lego-15k.