Data Structures Comparison

Implementation of basic data structures for comparison of how fast they perform.

Author: Bartosz Rodziewicz

Project done as a task during Algorithms and Computational Complexity (Struktury danych i złożoność obliczeniowa) course at the university.

There are two releases of this app:

v1.0 has implementation of Array, List, Heap and Binary Search Tree (with DSW algorithm). However the implementation of heap is broken.
v2.1 only has implementation of Array, List and Heap. There is a lot of small fixes and improvements to those structures in comparison to v1.0.

All of the structure classes inherit after Structure class.

The Program class is the main menu.

The app has console UI.

Name		Name	Last commit message	Last commit date
Latest commit History 93 Commits
.idea		.idea
wyniki		wyniki
.gitignore		.gitignore
Array.cpp		Array.cpp
Array.h		Array.h
CMakeLists.txt		CMakeLists.txt
Counter.cpp		Counter.cpp
Counter.h		Counter.h
Heap.cpp		Heap.cpp
Heap.h		Heap.h
LICENSE		LICENSE
List.cpp		List.cpp
List.h		List.h
Program.cpp		Program.cpp
Program.h		Program.h
README.md		README.md
Report - supplement 1.pdf		Report - supplement 1.pdf
Report.pdf		Report.pdf
Structure.cpp		Structure.cpp
Structure.h		Structure.h
TaskDescription.pdf		TaskDescription.pdf
main.cpp		main.cpp

Provide feedback