This article is the continuation of a series of articles on algorithms and data structures. The previous one was about quicksort. Why a binary search tree (BST)? If you remember from the previous article on quicksort, the only reason why we were sorting our words in the first place is because we decided to solve… Continue reading Binary Search Tree
Tag: algorithms
Quick Sort
Finally we arrive at learning about a fast algorithm that will actually solve us the problem very quickly. This article is a continuation on the insertion sort article. If you didn’t read it, you can do so by clicking here. This algorithm is much more complicated than the previous ones and there are many ways… Continue reading Quick Sort
Insertion Sort
This is the continuation of the last article on selection sort. Please check it if you didn’t read it yet. The last of the slow algorithms we will talk about is insertion sort. This is the best performing algorithm for small arrays. The idea is also very simple and like selection sort the array is… Continue reading Insertion Sort
Selection Sort
This is the continuation of the last article on bubble sort. If you didn’t read it you can read it clicking here. Another algorithm that is usually better than bubble sort is called selection sort. The idea is also very simple. You conceptually separate the list in two parts, the sorted one and the unsorted… Continue reading Selection Sort
Bubble Sort
This is the continuation of the previous article about the dynamic array data structure. If you didn’t read it you can read it clicking here. One of the prerequisites of doing a binary search is that the array or list has to be sorted. The algorithm that is usually taught as the first sorting algorithm… Continue reading Bubble Sort
Dynamic Array
It has been a long time since my last article about algorithms and data structures. This time I would like to continue on solving our problem mentioned in my previous Linked List article. If you still remember, the problem that we were trying to solve was to speed up the search for each permutation in… Continue reading Dynamic Array