算法导论（三版）：第二章第二节课后题

第二章：算法基础
第二节：分析算法

2.2-1

答：
θ(n^3)

2.2-2

Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A[1]. Then find the second smallest element of A, and exchange it with A[2]. Continue in this manner for the first n-1 elements of A. Write pseudocode for this algorithm, which is known as selection sort. What loop invariant does this algorithm maintain? Why does it need to run for only the first n - 1 elements, rather than for all n elements? Give the best-case and worst-case running times of selection sort in c-notation.
答：

1、python代码如下：

#!/usr/bin/env python
# -*- coding: utf8 -*-
"""
brief:算法导论(三版)的练习题2.2-2
author:zhangyang27@baidu.com
"""
import doctest
def selection_