pascal>> Data-Structure-Benchmark>> 返回
项目作者： viniciosbarretos

项目描述 ：
Comparison between tree, array and balanced tree
高级语言： C++
项目地址: git://github.com/viniciosbarretos/Data-Structure-Benchmark.git


Data-Structure-Benchmark

The objective of this work is to compare the efficiency of search algorithms in different data structures.

For the accomplishment of the experiment was used 3 different types of structures:

  1. Conventional Binary Tree
  2. Balanced Binary Tree with AVL Method
  3. Array sorted with QuickSort algorithm
report_1647874812397.pdf