算法竞赛基础训练题_填空题

填空题
A graph with 30 vertices and 40 edges must have at most 21 connected component(s).
A graph with 15 vertices and 38 edges must have at most 6 connected component(s).
程序填空题
Bubble sort is a simple sorting algorithm. Suppose we have a list of integers and want to sort them in ascending order. Bubble sort repeatedly scans the list from the head to the tail, and swaps two adjacent numbers if they are in th

算法竞赛基础训练题_填空题最先出现在Python成神之路。