@slavahead

Heapify with HeapSort

Jan 3, 2023 · 5 min read · Heap is a data structure that represents an array in a binary tree-based format. Heap imposes the following rules for its structure: Completeness. Every level of the heap is completely filled with elements. However, the last level may be partially f...

Sort Efficiently with Quick Sort

Dec 30, 2022 · 5 min read · Quicksort is probably the most popular sorting algorithm. In many experiments, it was shown that on average it performs better than other sorting methods like merge sort or heap sort. Algorithm Quicksort is based on the idea of splitting an array int...

Merge Sort Explained and Visualised

Dec 26, 2022 · 6 min read · When it comes to sorting, merge sort is one of the most popular algorithms. It is based on the famous “Divide-and-conquer” paradigm where a big problem is broken down into smaller problems which are easier to solve. The solutions to them are then com...

Constructing Objects with Builder Design Pattern

Dec 25, 2022 · 4 min read · Design patterns play an important role in software engineering. They make code more structured and easier to maintain. In this article, I would like to explain the concepts of Builder — one of the most popular creational patterns that are widely used...