CS 502 Fundamental of Algorithms
Assignment # 01
Spring 2012
Total Marks = 20
Deadline
Your๎assignment๎must๎be๎uploaded๎/๎submitted๎before๎or๎on๎April 23, 2012
Upload Instructions
Please๎view๎the๎assignment๎submission๎process๎document๎provided๎to๎you๎by๎the๎
Virtual๎University.๎
๎
Rules for Marking
Please๎note๎that๎your๎assignment๎will๎not๎be๎graded๎if:๎
โข It๎is๎submitted๎after๎due๎date๎
โข The๎file๎you๎uploaded๎does๎not๎open๎
โข The๎file๎you๎uploaded๎is๎copied๎from๎someone๎else๎or๎from๎internet๎
โข It๎is๎in๎some๎format๎other๎than๎.doc
Note: Material that is an exact copy from handouts or internet would be graded
Zero marks. Your solution should consist of the material found through
different sources and written in your own words.
Assignment Statements:
Question 1:
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
pseudo code 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 element, rather than for all n
elements? Give the best-case and worst-case running times of
selection sort in ฮ-notation.
Solution:
SELECTION-SORT (A)
n โ length[ A]
for j โ 1 to n โ 1
do smallest โ j
for i โ j + 1 to n
do if A[i ] < A[smallest]
docsity.com
