Investigating the performance of the implementations of embedded languages in haskell
B Wijgers - 2022 - studenttheses.uu.nl
Accelerate is a language for high-performance computing embedded in Haskell. Embedding
languages in other languages is a popular approach for language prototyping, as it reduces …
languages in other languages is a popular approach for language prototyping, as it reduces …
A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees
PS Ruzankin - SN Computer Science, 2022 - Springer
We suggest a new non-recursive algorithm for constructing a balanced binary search tree
given an array of numbers. The algorithm has O (N) time and O (1) auxiliary memory …
given an array of numbers. The algorithm has O (N) time and O (1) auxiliary memory …
On Hardy's Apology Numbers
H Koppelaar, P Nasehpour - arXiv preprint arXiv:2008.08187, 2020 - arxiv.org
Twelve well knownRecreational'numbers are generalized and classified in three
generalized types Hardy, Dudeney, and Wells. A novel proof method to limit the search for …
generalized types Hardy, Dudeney, and Wells. A novel proof method to limit the search for …
[PDF][PDF] A review on tree traversal techniques
R Bala, S Dhingra - 2018 - academia.edu
ABSTRACT A tree is a non-linear data structure for fast storing and retrieval of data in
primary memory. It represents data in the form of hierarchical form. Data are stored in a tree …
primary memory. It represents data in the form of hierarchical form. Data are stored in a tree …