**Category:**Algorithm

**Total:**100 Posts

Posts of Category: Algorithm

## K-Means Clustering with the Elbow method

.lazyload-placeholder { display: none; } K-means clustering is an unsupervised learning algorithm that groups data based on each point euclidean distance to a central point called centroid. The centroids are de...Learn MorePythonAlgorithmMachine Learningscikit-learndata science## Graphs in Python: Minimum Spanning Trees - Kruskal's Algorithm

Introduction Kruskal's algorithm is one of the three most famous algorithms for finding a minimum spanning tree (MST) in a graph. MSTs are widely used to calculate optimal paths in a lot of different fields. Fr...Learn MorePythonData StructureAlgorithm## Heap Sort in JavaScript

Introduction In this guide, we will explore Heap Sort - the theory behind it and how to implement Heap Sort in JavaScript. We will start off with what data structure it's based on (massive foreshadow here: it's...Learn MoreAlgorithmJavaScriptSortingHeap## Graphs in Java: Minimum Spanning Trees - Prim's Algorithm

Introduction Graphs are a convenient way to store certain types of data. The concept was ported from mathematics and appropriated for the needs of computer science. Due to the fact that many things can be repre...Learn MoreAlgorithmJavacomputer science## Graphs in Python: Dijkstra's Algorithm

Introduction 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...Learn MorePythonAlgorithm## Graphs in Python: Breadth-First Search (BFS) Algorithm

Introduction 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...Learn MorePythonAlgorithmsearch## Graph Theory and Graph-Related Algorithm's Theory and Implementation

Introduction Graphs are a convenient way to store certain types of data. The concept was "stolen" from mathematics and appropriated for the needs of computer science. There are several ways in which we can desc...Learn MoreAlgorithmmathsaicomputer sciencetheory## Graphs in Python: Depth-First Search (DFS) Algorithm

Introduction Originating from mathematics, graphs are now widely used data structures in Computer Science. One of the first problems we encounter when constructing any algorithm regarding Graph processing or tr...Learn MorePythonData StructureAlgorithmsearch## Counting Sort in Java

Introduction Sorting is one of the fundamental techniques used in solving problems, especially in those related to writing and implementing efficient algorithms. Usually, sorting is paired with searching - me...Learn MoreAlgorithmJavaSorting## Graphs in Python: Minimum Spanning Trees - Prim's Algorithm

Introduction Graphs are a great tool for modeling relationships between objects. Graphs can be used to model complex relationships between any number of objects in a system, which makes them ideal for represent...Learn MorePythonAlgorithm## Dijkstra's Algorithm vs A* Algorithm

Introduction 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 Whe...Learn MoreAlgorithmsearch## Phonetic Similarity of Words: A Vectorized Approach in Python

Phonetic Similarity of Words: A Vectorized Approach in Python In an earlier article I gave you an introduction into phonetic algorithms, and shows their variety. In more detail we had a look at the edit distanc...Learn MorePythonAlgorithm