![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法基础
文章平均质量分 86
weixin_44936379
这个作者很懒,什么都没留下…
展开
-
Algorithmic Toolbox 算法基础学习笔记(Closest Pair of Points using Divide and Conquer alogrithm)
Algorithmic Toolbox 算法基础学习笔记 【第四周习题 节选】Closest Pair of Points using Divide and Conquer alogrithm 文章目录Algorithmic Toolbox 算法基础学习笔记1. Problem Statement1.1. Task1.2. Input Format1.3. Constraints1.4. Output Format2. Brute Force Approach3. Divide and Conquer原创 2021-08-20 09:04:38 · 221 阅读 · 0 评论 -
Algorithmic Toolbox 算法基础学习笔记(第二周 习题节选)
Algorithmic Toolbox 算法基础学习笔记 例如:【第二周习题 节选】Fibonacci sequence, Pisano period, GCD and LCM 文章目录Algorithmic Toolbox 算法基础学习笔记前言2. Last Digit of a Large Fibonacci Number2.1. Problem Statement2.1. C++ Implementation4. Least Common Multiple4.1. Problem State原创 2021-07-11 19:50:05 · 227 阅读 · 0 评论 -
Algorithmic Toolbox 算法基础学习笔记(第一周)
Algorithmic Toolbox 算法基础学习笔记 【第一周】The Maximum Pairwise Product Programming Challenge & Stress Test 文章目录Algorithmic Toolbox 算法基础学习笔记1. The Maximum Pairwise Product Programming Challenge1.1. Naive Algorithm1.2. Efficient Algorithms:2. Stress Test 1.原创 2021-07-05 23:30:13 · 229 阅读 · 2 评论 -
Algorithmic Toolbox 算法基础学习笔记(第二周)
Algorithmic Toolbox 算法基础学习笔记 【第二周】Fibonacci sequence, GCD and Big O notation 目录Algorithmic Toolbox 算法基础学习笔记学习目标一、斐波那契数列(Fibonacci sequence)1. 定义1.3. Formula2. Naive Algorithm3. Efficient Algorithm二、最大公约数(Greatest Common Divisors)1.定义1.1. Definition:1.2. K原创 2021-07-03 09:34:12 · 161 阅读 · 0 评论