Readme

About this repo

This repo consists of my notes of algorithms and datastructures classes taught in University of Cyprus.

The repo contains most, if not all content as taught in the classes along with accompanied code. For educational purposes, the code is written in python and/or C. Special cases and optimisations that are either not possible in python or make little sense to implement in Python, will be implemented C. It's expected that the reader is familiar with Object Oriented Programming and pointers.

Content

Lecture Notes

Note : The lectures above are only the lectures I have compiled so far. For a complete list of the Lectures I am working on, checkout the roadmap.

Algorithms

Check out Algorithms.md for a list of all algorithms in the repository

Datastructures

Check out Datastructures.md for a list of all Datastructures implemented in the repository

Note style

Code

All code will be marked ```Language ...code... ``` when the lecture is read in raw format. When viewed through Github and Pandoc, it will be color coded based on the language as such:

Python

    class foo:
        def __init__(self):
            print("bar")

All Python code is written with Python 3.6

#include <stdio.h>
int main(void){
    char * foo = "bar";
    printf("%s",foo);
    return 0;
}

All C code is Compiled with gcc 7.2.0 and flags -Wall -pedantic on Manjaro Linux.

Lectures

Ideas and information presented in Lectures will be written and explained in the equivalent Lecture markdown file. Some Lectures are split into more parts and others are condensed such that they make sense together.

Roadmap

Write Lectures 0 - 3:

Rewrite Readme.md
Move Raw and Compiled lectures to their own folders.
Fix some grammar/spelling mistakes as well as some formula visibility issues in Lectures 0-3.

Write the following Lecture notes:

parekhabhishekn/Datastructures-and-Algorithms-notes