Project 5 quick sort

1
Project 5 quick sort
2
Goal

• Define a function named uID to perform quick sort
  to sort a number list

3
IO

• Input a number list variety lengthe.g. (1 4 5
  8 9 6 3 5 4 )(100 589 32 1 5 844 58 5 2 12 6 8
  )
• Output
• Message of sorting process(no specified form and
  conten )e.g. pick 1 as pilotpick 3 as
  pilot
• The sorted liste.g.(1 3 4 4 5 5 6 8 9)
• Print in the echo area, we will check your source
  code one by one

4
Requirements

• Name your source ID.ele.g. 123456.el
• Name your function uID.ele.g. (defun u123456
  (alist)SAMPLE FUNCTION(cdr alist))

5
Testing environment and flow

• Under cs20., Emacs
• We will load your function first bye.g.M-x
  load-fileID.el
• Then feed some list to your functione.g.(setq
  list1 ( 9 8 5 4 6 3 2 1))(uID list1)
  evaluating your function

6
Dilievery

• Zip(please dont tar) following as ID.zip
• Your source code, ID.el
• A ReadMe
• Upload your zip file to
• ftp//140.114.79.122
• Port33
• Usr cs2403
• psw student
• Due date(hard deadline)A.M.1200,6/17/2005