17 posts tagged with "big o"

Hi, in the sixth part of my graph series, I want to talk about the Kruskal algorithm. We have programmed Prim in Python in the fifth part. Now it's time for Kruskal.

Hi, in the third part of my graph series, I want to talk about the search algorithms. We have programmed the graph in Python in the second part. Now it goes to the search algorithms. Each search algorithm will be discussed in separate posts.

Hi, in the fourth part of my graph series, I want to talk about breadth-first search. We have programmed the depth-first search in Python in the third part. Now we will go into the breadth-first search.

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.

Quicksort is a sorting method according to the principle "divide and conquer" with an effort in best case $O(n Log(n))$ in avg case $O(n Log(n))$ and in worst case $O(n^2)$

Mergesort is a sorting method to sort relatively fast huge amounts of data. Mergesort belongs to the divide & conquer algorithms with a big notation of $n log(n)$