https://github.com/erykmika/datastructures

This repository contains my solutions to the tasks that I had to solve during the "Data structures and time complexity" classes.
https://github.com/erykmika/datastructures

data-structures politechnikawroclawska university-project

Last synced: about 2 months ago
JSON representation

This repository contains my solutions to the tasks that I had to solve during the "Data structures and time complexity" classes.

• Host: GitHub
• URL: https://github.com/erykmika/datastructures
• Owner: erykmika
• Created: 2023-07-06T15:38:45.000Z (over 1 year ago)
• Default Branch: master
• Last Pushed: 2023-09-25T15:59:26.000Z (over 1 year ago)
• Last Synced: 2023-10-08T16:32:59.968Z (about 1 year ago)
• Topics: data-structures, politechnikawroclawska, university-project
• Language: C++
• Homepage:
• Size: 19.5 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# DataStructures

This repository contains my solutions to the tasks that I had to solve during the "Data structures and time complexity" classes.  

## Project list  

### Graphs  

This project contains two implementations of storing a directed, weighted graph in memory. These include an adjacency matrix and an adjacency list.

Performance of algorithms using two methods is tested.

  

### Priority Queue

This project has been done to implement two ways of keeping a priority queue. The first one uses a circular buffer in a regular array while the second utilizes a doubly linked list. Performance of adding and deleting operations on both data structures is examined.

  

### Binary Heap

The project uses two methods to implement a binary heap - both using an array and a pointers-based binary tree. Efficiency of heap sort on these two structures is compared against an STL algorithm.

## Setup

**Clone the repository and use Code::Blocks IDE to run project files.**