Skip to content

Two homeworks, binary tree and stable selection sort, made for "Algorithms and data structures (winter 2019)" course.

License

Notifications You must be signed in to change notification settings

JMazurkiewicz/AISDI-homeworks

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Homeworks for "Algorithms and data structures" course

CI

Building

To build homeworks use CMake:

cd <homework>
cmake -B build
cmake --build build

Testing

Programs are tests by themselves so just use ctest:

cd build
ctest

Homework 1 - binary tree

Homework requirements:

  • Create binary tree class
  • Fill tree with random values
  • Randomly remove values from filled tree

Homework 2 - stable selection sort

Homework requirements:

  • Create singly linked list of playing cards (French suit) that represents the deck
  • Shuffle the deck with custom algorithm
  • Create stable selection sort algorithm to sort shuffled deck

About

Two homeworks, binary tree and stable selection sort, made for "Algorithms and data structures (winter 2019)" course.

Topics

Resources

License

Stars

Watchers

Forks