Heap-Sort is a comparison-based sorting algorithm that uses the properties of a binary heap (max-heap or min-heap). It efficiently sorts data in O(nlogn) time and is an in-place sorting algorithm, ...

This project solves a graph optimization problem for a fictional home builder. The builder has a list of potential doors that can connect different rooms in a house. Each door has an associated cost.

Abstract: This paper describes an implementation of Kruskal's algorithm in query optimization process for generation of a near optimal execution query tree. The open source Post- greSQL DBMS was used ...