SelectionSort is a sorting method, which works in-place, here no new array is created for the sorting. SelectionSort works in bestcase, averagecase and worstcase, with an overhead of $O(n^2)$.

A ring buffer is a data structure that works similar to a queue. Why similar? From the principle it is a queue, the difference to normal queues is that these have a fixed size in the normal case. A ring buffer works according to the FIFO principle like the queue.

InsertionSort is a sorting method which is easy to implement. InsertionSort works on the principle that you go through the array to be sorted and compare each element with its predecessor. You start at the 2nd element in the array.

A stack is a data structure which is used in many areas, e.g. in CPUs, in network technology under Linux(TCP/IP stack), or also generally with other algorithms like e.g. PDAs, depth search in graphs, etc....

Hi, I had thought about a little troll for a colleague in front of me. Short story he gambles a lot on Steam, I thought how can I torch him a bit, but so that he does not realize that it is me 😄

I had been dealing with Prolog for a long time and I just want to say something about it.

Predicate logic is the extended form of propositional logic and a branch of mathematical logic. This is used to check and describe things better in the core logically.

The Big-O notation, many talk about it but what is it? It is the question, how fast is the code, which you have in front of you. You have an algorithm that is supposed to solve a task, all well and good, but how long does it take? And more importantly, how does it look with a lot of data?

Linked lists, or single or double linked lists, are data structures that represent dynamic lists. The data structure is fundamental and consists of two classes, the list and the nodes.

Hashing is a data structure which allows to add and read data with $O(1)$. But the search is done with $O(n)$.