DATA STRUCTURE SPARSE TABLE

Authors

  • Islom Iskandarov TUIT Urgench Branch

Keywords:

data structures, algorithms, sparse table

Abstract

This article discusses the sparse table data structure: description, capabilities, and scope of application. The results of comparison with such data structures as a segment tree and a sqrt decomposition for two problems are shown. The listing codes are presented in the C++ programming language.

References

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to Algorithms”, 3rd ed, pp. 9.

http://www2.compute.dtu.dk/courses/02282/2021/nca/CPbook.pdf

M. A. Bender, M. Farach-Colton. The LCA problem revisited. In Latin American Symposium on Theoretical Informatics, 88–94, 2000.

Downloads

Published

2023-11-30

How to Cite

Iskandarov, I. (2023). DATA STRUCTURE SPARSE TABLE. Acta of Turin Polytechnic University in Tashkent, 13(3), 34–37. Retrieved from https://acta.polito.uz/index.php/journal/article/view/210

Issue

Vol. 13 No. 3 (2023): ACTA OF TURIN POLYTECHNIC UNIVERSITY IN TASHKENT

Section

Technical Science and Engineering