In this post about the bubble sort algorithm in Python, we want to look into how to implement and visualize it. Bubble sort isn’t quite an efficient algorithm when it comes to time complexity. However, it is easy to code and to understand, so it is often an introductory problem for computer science students and pupils.
In this article we want to take a look at the k-means algorithm. The k-means algorithm is used to determine clusters. It is often the first algorithm you will see in any machine learning introduction, as it is easy to understand. We will code the algorithm in Python and also visualize it.
The Marching Cubes Algorithm is a meshing algorithm in the field of computer graphics. It is used to extract a polygonal mesh out of an isosurface from a three- or two-dimensional scalar field. It is primarily used for visualization modeling because it makes it easy to adjust the generated mesh.
The midpoint line algorithm is a drawing algorithm in the field of computer graphics. It is used to determine how lines are translated into pixels.