Search Results for "memory usage"

JS-Sorting-Algorithm is an educational repository and GitBook-style resource about classic sorting algorithms. It explains sorting as a core topic in data structures and algorithms, with attention to internal sorting, external sorting, time complexity, memory usage, and stability. The guide covers ten major sorting methods, including bubble sort, selection sort, insertion sort, shell sort, merge sort, quicksort, heap sort, counting sort, bucket sort, and radix sort. It compares algorithms by complexity classes such as quadratic time, linearithmic time, and linear time. The repository also includes terminology explanations for concepts like data size, buckets, in-place sorting, out-place sorting, and stability. ...

AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. Almost all classes and methods are thoroughly documented via JavaDoc (you may read full JavaDoc at the site).

A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of the new tree sub-category, there can be others. In any case, read the PDF: “Capsule Trees - A Primer”, before delving into the code.