I am preparing for Codility. And I need to find out what is the fastest way to find an array with big values and many entries?
Is inbuilt python sort is the fastest or do i need to implement some other sort method?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am preparing for Codility. And I need to find out what is the fastest way to find an array with big values and many entries?
Is inbuilt python sort is the fastest or do i need to implement some other sort method?
If your data is already in Python, the Python’s sort is likely the fastest way to go. It uses the Timsort algorithm which performs well on random data and very well on partially ordered data.
If you only need the largest items, use heapq.nlargest.