Project created for add to my portfolio. Sorting elements.
At this moment, I writing sort algorithms which nobody not use on a practice, but asking on a interview ☺ My future plans is add next algorithms:
- CombSort (in Russian: Сортировка расчёской);
- Insertion Sort (in Russian: Сортировка вставками);
- Shellsort (in Russian: Сортировка Шелла);
- Selection Sort (in Russian: Сортировка выбором);
- Quick Sort (in Russian: Быстрая сортировка);
- Merge Sort (in Russian: Сортировка слиянием);
- Heap Sort (in Russian: Сортировка кучей);
- Smoothsort (in Russian: Плавная сортировка);
- Patience sorting (in Russian: Терпеливая сортировка);
- Tree Sort (in Russian: Сортировка с помощью бинарного дерева);
- Bucket Sort (in Russian: Карманная сортировка);
- Radix Sort (in Russian: Цифровая сортировка);
- Counting Sort (in Russian: Сортировка подсчетом);
- Han's Sort (in Russian: Сортировка Хэна);
- Multithreaded merge sort (in Russian: Многопоточная сортировка слиянием);
- PSRS-sorting (in Russian: PSRS-сортировка);
- Timsort (it's from wiki, I don't know what is it).
Now, I sorting integer numbers. Maybe it's grow up into something biggest. I don't now. I practices. I like it.
That there was no too many everything, I decided write two options:
- sorting in descending and ascending order;
- sorting from beginning to end and backwards. Combined options, I get two most different methods, if it posible.
Thats all folks! «Looney Tunes»
= = = Add comment to class «CocktailSort» or use in other algorithm // second example use bitwise operation XOR // A = A ^ B = 0101 ^ 1001 = 1100 // B = A ^ B = 1100 ^ 1001 = 0101 // A = A ^ B = 1100 ^ 0101 = 1001 // https://habr.com/ru/post/332088/