IMAC Algoritm

First semester

Basic use of the C langage.

Second semester

You need to install QT creator and run the .pro files with it. Works both on linux and windows.

You can also use Visual Studio to edit and build your code with the QT Visual Studio Extension. But you need the QT lib installed on your computer.

TP1 - Array sorting

• Selection sort - [DONE]
• Insertion sort - [DONE]
• Bubble sort - [DONE]
• Quick sort - [DONE]
• Fusion sort

TP2 - Recursivity

• Sum - [DONE]
• Power - [DONE]
• Fibonacci - [DONE]
• Search - [DONE]
• AllEvens - [DONE]
• Mandelbrot - [DONE]
• Merge sort

TP3 - Binary search

Search

• Binary Search - [DONE]
• Binary Search ALL - [DONE]

Binary tree

• Insert number - [DONE]
• Height - [DONE]
• Nodes count - [DONE]
• Is leaf - [DONE]
• All leaves - [DONE]
• In order travel - [DONE]
• Pre order travel
• Post order travel
• Search - [DONE]
• Insert number (with equilibrium)

TP4 - Heap and Stack

Heap

• Left child - [DONE]
• Right chilld - [DONE]
• Insert heap node - [DONE]
• Heapify - [DONE]
• Build heap - [DONE]
• Heap sort - [DONE]
• Char frequences

Huffman encoding

• Heap - [DONE]
• Dict - [DONE]
• Encode - [DONE]
• Decode - [DONE]

TP5 - Hash tables

• Hash - [DONE]
• Insert - [DONE]
• Contains - [DONE]