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
Category: Data Structures
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
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
Linked List
A couple of weeks ago I presented the topic of linked lists to my colleagues. The reason for that is that some of our colleagues don’t have a computer science background and they never learned it, even though they are software developers, but also because it was a bit forgotten to some of the others.… Continue reading Linked List