Have you ever implemented a sort(not using stl)?
I am a master and I implemented my first nlogn sort algorithm recently.
Do you implement sort during contest time?
→ Обратите внимание
До соревнования
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
15:03:43
Зарегистрироваться »
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
15:03:43
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 30.11.2024 02:31:18 (h2).
Десктопная версия, переключиться на мобильную.
При поддержке
I remember taking an online computer science course (link) from Harvard before I was even interested in competitive programming, and I implemented merge sort using C.
WOW! My merge sort code had a lot of bug.
Here is my implementation in C++.
does implementing merge sort tree count?
No. I did it before implementing merge sort.
When I first started CP I implemented bubble sort a few times because I was too lazy to figure out how to use the standard library sort. :P
A lot earlier when I didn't know about std::pair I had to write my own sorting function whenever I needed to store the original index of elements so that I can take 2 different arrays (one for storing index)
Nah, I usually assert that the array comes already sorted. Sometimes it works.
some interactive problems you need to implement sorting with very little comparison.
Then you have to implement ford johnson :/
No comparision sort: counting sort, radix sort, etc. But not in interactive
Yeah this happened during the snackdown 2018 when we were in the first year of our college.One of my friend started writing merge sort code from his notes.Lol!
In the times of old (2006 I think) most people still used pascal in NEERCm and it lacks sort algorithm in it's standard library. One team almost got disqualified because they tried to hide prewritten sort algorithm in shortcut during practice session to have it ready for main contest