The Algorithms Interest Group

Introduction

Introduction

Lecturer: Steve Yan

Location: Macao Polytechnic Institute

Time Schedule: TBA

Useful URLs

Typora: typora.io

LeetCode: leetcode/problemset

POJ: poj/problemlist

How to use this repository?

Clone via HTTPS using following command or Click Code then Download ZIP.

git clone https://github.com/Ex10si0n/Algorithms.git

You can open README.md (Markdown File: open via Typora or notepad.exe) locally or on this page.

Assessments

• Attandance

• Assignments

Outline (Legacy Version for 2021)

This lecture will specifically focus on the Algorithm implementation. My example code will be demonstrated in Python, but you can adopt any kind of programming language if you prefer.

No slides are distributed (cuz. I do not regard slides as an efficient format to display codes) but all of the codes and explanations are shown on this README.md.

Outline (New Version for 2022)

C++ is essential for Algorithms Development due to its high efficiency of execution. However, it is not as easy as the Python language in implementation. In this Interest Group, we adopted C++ in Algorithm design. You are welcome to set this website as a favorite to visit at any time. No slides will be distributed in this lecture, you are free to copy or share the codes on this website. All the contents are under the Attribution 4.0 International (CC BY 4.0) license.

The following topics will be covered in the Interest Group

• Fundamental Methodologies

  • Greedy (贪心)

  • Binary Search (二分)

  • Recursion (递归)

  • Data Structure (数据结构)

    • Linear Structure

      • Queue (队列)

      • Stack (栈)

    • Generic Tree

      • Tree (树)

      • Binary Tree (二叉树)

      • Linear Structure (maintained by Tree) (由树维护的线性结构)

        • Binary Indexed Tree (二叉索引树)

        • Segment Tree (线段树)

    • Generic Graph

      • Graph (图)

• Graph Theory (图论)

  • Minimum Spanning Tree (最小生成树)

  • Depth-first Search (深度优先搜索)

  • Multiple Source Shortest Path - I (多源最短路径)

    • Floyed-Warshall

  • Breadth-first Search (广度优先搜索)

  • Shortest Path - II (单源最短路径)

    • Dijkstra

    • SPFA

  • Network Flow (网络流)

    • Ford-Fulkerson (最大流算法)

  • Bipartite Graph (二分图)

Before We Start (for MPI Algorithms lecture)

Here are some useful tools for coding. I will briefly introduce them as follows:

vim (neovim)

Vim is a highly efficient code editor in the command line. I will use vim to implement the code of algorithms in this lecture. You can try to use it with ease because I will specifically introduce some shortcuts and modes of vim. But you are free to adopt any IDEs or text editor you like. You can install it by command:

Installation

# Linux
sudo <package-manager> install neovim

# macOS
brew install neovim

# Windows
choco install vim

Package manager installation on macOS and Windows

# macOS (in Terminal.app)
/bin/bash -c "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/HEAD/install.sh)"

# Windows (in powershell.exe with Administrator)
Set-ExecutionPolicy Bypass -Scope Process -Force; [System.Net.ServicePointManager]::SecurityProtocol = [System.Net.ServicePointManager]::SecurityProtocol -bor 3072; iex ((New-Object System.Net.WebClient).DownloadString('https://community.chocolatey.org/install.ps1'))

Or install vim in IDEs (better experience)

Demo at Jetbrains/using-product-as-the-vim-editor

LeetCode

LeetCode in 知乎. It is a good platform for elementary algorithms learning. It is appropriate for preparing for a job as well as learning algorithms.

If you do not have a LeetCode account, please visit Leetcode.com or Leetcode-cn.com (中文题目) to create an account.