Abstract: k-dimensional (k-d) trees are one of the most important data structures in the fields of data engineering and so-called Big Data. In this paper we propose a scheme parallelizing the ...

This repository provides about 55 Jupyter notebooks (March 2026) with the implementation of basic algorithms and data structures. You can play around with the code in many ways. The intention is to ...

This makes the heapsort the only sorting algorithm that can sort the first k items out of a set of n items without sorting the whole set. Indeed let’s say we have a set of positive integers and we’d ...