Article

Graphs are one of the most useful data structures. They can be used to model practically everything - object relations and networks being the most common ones. An image can be represented as a grid-like graph of pixels, and sentences can be represented as graphs of words. Graphs are used...

Mila Lukic

Every single search algorithm consists of: The current state of the problem Possible actions that can be done in order to change that state The ability to recognize the final state - our goal When it comes to Artificial Intelligence, there are two types of search algorithms: Uninformed search algorithms...

Borůvka's Algorithm is a greedy algorithm published by Otakar Borůvka, a Czech mathematician best known for his work in graph theory. Its most famous application helps us find the minimum spanning tree in a graph. A thing worth noting about this algorithm is that it's the oldest minimum spanning tree...

A Stream is a sequence of objects that supports many different methods that can be combined to produce the desired result. They can be created from numerous data sources, which are most often collections but can also be I/O channels, Arrays, primitive data types etc. It's important to emphasize...

Python is a very high-level programming language, and it tends to stray away from anything remotely resembling internal data structure. Because of this, we usually don't really need indices of a list to access its elements, however, sometimes we desperately need them. In this article, we will go over different...

Comparison operators are used in logical statements to determine whether two variables or objects are equal by some already set or custom defined criteria. If the two variables or objects are deduced to be equal the operator returns true, and false if they aren't. Comparison operators in JavaScript are: <...

In this article, we will explain what the idea behind Insertion Sort is and implement it in JavaScript. Insertion Sort is one of the simpler sorting algorithms. It's highly intuitive, stable, in-place, and of comparison-type. A stable sorting algorithm is an algorithm in which two objects with equal keys appear...

Selection Sort is one of the simpler and more intuitive sorting algorithms. It is an in-place, unstable, comparison algorithm. This means that it transforms the input collection using no auxiliary data structures and that the input is overridden by the output (in-place algorithm). Additionally, during its execution, it only reads...

Bubble Sort, sometimes also referred to as Sinking Sort is one of the most widely known sorting algorithms. It is usually one of the first sorting algorithms that CS students come across due to its simplicity and the fact that it is quite intuitive and easy to translate into code....

© 2013-2024 Stack Abuse. All rights reserved.