About this Course
4.8
284 ratings
35 reviews
Specialization
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Hours to complete

Approx. 20 hours to complete

Suggested: 每周4-8小时...
Available languages

Chinese (Simplified)

Subtitles: Chinese (Simplified)...
Specialization
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Hours to complete

Approx. 20 hours to complete

Suggested: 每周4-8小时...
Available languages

Chinese (Simplified)

Subtitles: Chinese (Simplified)...

Syllabus - What you will learn from this course

Week
1
Hours to complete
24 minutes to complete

欢迎加入我们!

好的算法是程序设计的灵魂!拥有了骄人战绩的你,在熟练掌握程序设计语言的同时,只有掌握了算法这个利器之后,才能在驾驭程序开发项目中出其不意、鬼斧神工!欢迎加入《算法基础》课程,为你的程序插上飞翔的翅膀!PS:我们这门课程一直处在不断地建设与优化当中,吸取了很多以往课程的经典视频,所以如果你看到视频中出现了不同课程的名字,也不要惊讶哦,因为你正在集百家所长:)...
Reading
2 videos (Total 4 min), 2 readings
Video2 videos
欢迎加入算法基础课程1m
Reading2 readings
如何学好这门慕课?10m
程序AC你必须知道的秘密10m
Week
2
Hours to complete
4 hours to complete

枚举

在日常生活中我们经常遇到这样的情景:数字密码最后一位忘记了,就从0~9逐个尝试;去提货点取快递,快递员检查完所有包裹才找到属于你的;警察列举出所有的嫌疑人才有可能发现真凶…以上在进行归纳推理时,逐个考察了某类事情的所有可能情况,并逐一进行检验,这种方法叫做枚举。枚举比较直观,易于理解,本模块将介绍枚举算法的基本数学模型和常用策略,从而解决通过公式推导、规则演绎的方法不能解决的问题。PS:我们这门课程一直处在不断地建设与优化当中,吸取了很多以往课程的经典视频,所以如果你看到视频中出现了不同课程的名字,也不要惊讶哦,因为你正在集百家所长:)...
Reading
3 videos (Total 76 min), 1 reading, 1 quiz
Video3 videos
熄灯问题 35m
讨厌的青蛙26m
Reading1 reading
课程Slides10m
Week
3
Hours to complete
5 hours to complete

递归

递归调用是设计和描述算法的一种有力工具,尤其是在解决复杂问题时经常采用。它的基本思想是要解决某一问题A,可以先解决一个形式相同,但规模小一点的问题B。问题B如果解决了,那么问题A也就迎刃而解。有些问题使用传统的迭代算法是很难求解甚至无解的,而使用递归却可以很容易地解决。本模块将通过具体的例题介绍如何构造递归函数,如何设置递归终止的条件以及分析递归算法的复杂度。...
Reading
4 videos (Total 97 min), 1 reading, 1 quiz
Video4 videos
小游戏 27m
棋盘分割26m
用栈替代递归25m
Reading1 reading
课程Slides10m
Week
4
Hours to complete
5 hours to complete

动态规划(1)

通过上一模块的学习,你已经了解如何通过递归的办法解决问题,但是单纯的递归往往会导致子问题被重复计算,因此在解决某些问题的时候,效率会很低。而将一个问题分解为子问题递归求解,并且将中间结果保存以避免重复计算的方法就叫做“动态规划”。本模块将初步介绍对于特定的问题如何寻找子问题、定义问题的状态以及状态转移方程。...
Reading
3 videos (Total 96 min), 1 reading, 1 quiz
Video3 videos
几个例题 33m
灌溉草场(较难) 31m
Reading1 reading
课程Slides10m
4.8
35 ReviewsChevron Right

Top Reviews

By CDJun 30th 2016

Best teachers, they are very responsible for questions.

Instructors

Avatar

Jiaying Liu 刘家瑛, Ph.D.

Associate Professor
Institute of Computer Science & Technology
Avatar

郭 炜

讲师
北京大学信息科学技术学院教学所

About Peking University

Peking University is determined to make its education openly accessible to students in China and around the world. With over 3000 faculty members, Peking University offers excellence in teaching and learning. Founded in 1898, Peking University (PKU) was the first national comprehensive university in China. For the past 115 years, with its hundreds of thousands of outstanding alumni, Peking University has made prominent contributions in the humanities and sciences to further China's prosperity and progress....

About the 程序设计与算法 Specialization

本专项课程旨在系统培养你的程序设计与编写能力。系列课程从计算机的基础知识讲起,无论你来自任何学科和行业背景,都能快速理解;同时我们又系统性地介绍了C程序设计,C++程序设计,算法基础,数据结构与算法相关的内容,各门课之间联系紧密,循序渐进,能够帮你奠定坚实的程序开发基础;课程全部配套在线编程测试,将有效地训练和提升你编写程序的实际动手能力。并通过结业实践项目为你提供应用程序设计解决复杂现实问题的锻炼,从而积累实际开发的经验。因此,我们希望本专项课程能够帮助你完成从仅了解基本的计算机知识到能够利用高质量的程序解决实际问题的转变。...
程序设计与算法

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

More questions? Visit the Learner Help Center.