computerscience - Angevins

Heap Sort is a sorting algorithm that sorts an array by first converting it into a binary heap data structure. A binary heap is a complete binary tree in which the value of each node is greater than or equal to its children's values. To perform heap sort,...

canterbury christ church university / Angevins / computerscience

The Floyd-Warshall algorithm is a dynamic programming algorithm used to find the shortest paths between all pairs of vertices in a weighted graph. It is named after Robert Floyd and Stephen Warshall, who independently published it in 1962 and 1962, respect...

canterbury christ church university / Angevins / computerscience