Вернуться к Data Structures and Algorithms (I)

## О курсе

By learning this course, you will get a comprehensive grasp of vector and list and the ability to use them in solving real problems. By the end of this course, you will be able to evaluate data structures and algorithms in terms of asymptotic complexity, analyze storage/time complexity of iterative/recursive algorithms, implement vector and list, understand/implement basic sorting algorithms such as Bubblesort, Insertionsort, and Selectionsort, understand/implement search algorithms such as Binary Search, Fibonacci Search, and Interpolation Search, use vector and list in problem-solving. 通过学习本课程，你将得到向量和列表的全面理解以及使用向量和列表解决实际问题的能力。 在本课程结束时，你将能够根据渐进复杂度评估数据结构和算法，分析迭代/递归算法的空间/时间复杂度，实现向量和列表， 了解/实现基本排序算法（例如冒泡排序、插入排序和选择排序），理解/实现搜索算法（例如二分搜索、斐波那契搜索和插值搜索）， 使用向量和列表解决问题。...

Фильтр по:

автор: Toni H

30 июня 2020 г.

автор: 黄瓒

18 авг. 2020 г.

автор: cornell

4 сент. 2020 г.

автор: Toan V V

11 июня 2021 г.

автор: Yew T C

24 окт. 2021 г.

автор: MAMTA L

24 сент. 2020 г.