Skip to content

Repository files navigation

algorithm_course_uni

This repository contains my code for my 2nd semester algorithms course in uni. I decided to do all the exercises from scratch again to practice and challenge my understanding of algorithms.

brief description

  • each folder represents every topic for this course, and contains my solutions for the exercises during the meeting.
  • the formats of each code is straighforward. The objective of the task is commented at the top of the code, meanwhile the time complexity is commented at the bottom
  • I might add a step-by-step explanation to every code later once I have finished all the topics

table of contents

01 - introduction to algorithms

  • python basics
  • print, input
  • mathematical and logical operators
  • if-else statements

02 - algorithm complexity

  • time complexity
  • for and while loop

03 - brute force (complete search) pt. 1

  • nested loop
  • 2d lists
  • bubble sort

04 - brute force (complete search) pt. 2

  • substrings
  • linear search

05 - recursion

  • fibonacci sequence
  • decimal to binary conversion
  • combinations

06 - divide and conquer pt. 1

  • binary search
  • calculating the power of a number in O(log m) complexity

07 - divide and conquer pt. 2

  • merge sort
  • tower of hanoi
  • quick sort

08 - dynamic programming pt. 1

  • fibonacci sequence using memoization
  • minimum coin change (bottom up approach)
  • longest palindrome using memoization (not added yet)

09 - dynamic programming pt. 2

  • not added yet

10 - greedy pt. 1

  • not added yet

11 - greedy pt. 2

  • not added yet

12 - graph algorithms pt. 1

  • not added yet

13 - graph algorithms pt. 2

  • not added yet

14 - graph algorithms pt. 3

  • not added yet

About

This repository contains my code for my algorithms course in uni. (in progress)

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages