Category Archives: algorithms

Implementations of algorithms and design patters. Examples written mostly in Java and C++.

[C++] List sorting – bucket sort and others

Posted on June 15, 2020 by codesmuggler | Programming Help | Coding assignment help

In this article I will show you pure implementation of algorithms, which can be used to sort lists + list implementation. Bucket sort, quicker sort and insertion sort. Check also previous articles on the same topic: – C++ radix sort … Continue reading →

Leave a comment

[C++] Convex hull – Graham algorithm

Posted on April 13, 2020 by codesmuggler | Programming Help | Coding assignment help

In this article I will concentrate on Graham algorithm – method of computing convex hull. The complexity of this algorithm is equal to O(nlogn). Assuming that you already know the Graham algorithm, let’s move to the implementation ;) 1. Declare … Continue reading →

2 Comments

[C++] Radix sort – integers sorting

Posted on January 30, 2020 by codesmuggler | Programming Help | Coding assignment help

I have recently written article about counting sort, a linear complexity stable sorting algorithm: C++ counting sort implementation. Now I want to introduce you another fast sorting algorithm – radix sort. It is divided into two parts: one part that … Continue reading →

2 Comments

[C++] Counting sort: faster than quicksort!

Posted on January 15, 2020 by codesmuggler | Programming Help | Coding assignment help

Probably you know sorting at good level, wrote quicksort and other fast algorithms thousand times. The best sorting algorithms which as main operation have comparing one value to another has O(nlogn) complexity. With the assumption of comparing values they couldn’t … Continue reading →

Leave a comment