下面算法是实现对n个整数的序列进行选择排序，其中序列的“长度”n为问题的规模。该算法的时间复杂度为(11)。　　　　void　select_sort(int　a[]，int　n){　　　　//将a中整数序列重新排列成从小到大有序的整数序列　　　　for(i=0；i＜n-1；++i){　　　　j=i；　　　　for(k=i+1；k＜n；++k)if(a[k]＜a[j])j=k；　　　　if(j!=i){w=a[j]；a[j]；a[i]；a[i]=w}　　　　)//select_sort

(65)

(63)

(64)

(62)

Network　managers　have　long　awaited　practical　voice-over-IP(VOIP)solutions.　VOIP　promises(71)network　management　and　decreases　costs　by(72)a　company's　telephony　and　data　infrastructures　into　one　network.　And　a　VOIP　solution　implemented　at　a　company'　s　head　-quarters　with　far　-reaching　branch　offices　can(73)tremendous　amounts　of(74)in　long　distance　phone　bills,　provided　that　solution　delivers　POTS　-like　voice(75)over　the　Internet.

(60)

(59)

(58)

(66)is a protocol that a host uses to inform. a router when it joins or leaves an Internet multicast group.

(67)is an error detection code that most data conlmunication networks use.

(68)is an interior gateway protocol that uses a distance vector algorithm to propagaterouting information.

(69)is a transfer mode in which all types of information are organized into fixed form. cells on all asynchronous or nonperiodic basis over a range of media.

(70)is an identifier of a web page.

(57)