Skip to content

Latest commit

 

History

History
18 lines (9 loc) · 1.24 KB

README.md

File metadata and controls

18 lines (9 loc) · 1.24 KB

IFNMG-Busca_e_Ordenacao-2023-1

Answers to the Labs of the discipline Search and Sorting at the Federal Institute of Education, Science and Technology of Northern Minas Gerais.

I had a lot of fun with this class, as the professor gave us freedom to make our programs the way we wanted, so I spent a lot of time making TUIs (Terminal User Interface).

  • Lab1: Bubble Sort implementation on both dynamic and static allocated lists, a "StressMode" for testing performance and a bunch of jokes about zero-sized lists.

  • Lab2: A TUI made with ncurses. Oh, and also QuickSort.

Gravacao.de.Tela.2023-08-17.as.21.29.42.mov
  • Lab3: A better TUI with lots of code improvements and new features, such as auto centering inside the terminal window, a brand new Makefile, heap sort, merge sort and a (commented) ncurses port of Andy Sloane's famous spinning donut that I used as placeholder during development but loved it too much to delete (the original donut.c was Windows specific so I ported it to ncurses so it could run it on Linux).
Gravacao.de.Tela.2023-08-17.as.21.33.21.mov
  • Lab4: KMP algorithm (No TUI here 😿).