New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

sorted - алгоритм сортировки, математически не может работать быстрее, чем за O(n*log(n)), 3 раза найти максимум работает за O(n), предлагаю сэкономить время пользователя и 3 раза найти максимум #23

Open

Popov-Dmitriy-Ivanovich opened this issue Dec 15, 2023 · 1 comment

Owner

Popov-Dmitriy-Ivanovich commented Dec 15, 2023

Hackaton/analys/analyze_user.py

Line 76 in 89e9ae0

sorted_user_data = sorted(user_data.items(), key=lambda x: x[1], reverse=True)

Contributor

Fahnenfluchtige commented Dec 16, 2023

ок

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment