CS3240: Data Structures and Algorithms

BubbleSort
PEER GRADED

due Feb. 28 (extended to March 12)

In this lab, you will implement the BubbleSort Algorithm. You will perform the sort on an array of 100 randomly generated integers ranging from 0 to 1000. Your program should print out the initial array and then finally the sorted array.

NOTE: each time you run your program it should generate a new set of 100 random numbers. (hint: seed your random number genertor)

Deliverables

1. Show in class to peer grader
2. Take snapshots of system working and printouts - put in a document called working.doc. Must include testing running a minimum of 2 times (hence with different set of 100 random numbers).
3. Upload code in a zipped file called code.zip to blackboard Exercise
   
   
   

Evaluation

1. This exercise will be graded by a peer (fellow student) during class. You must be present on the due date of this exercise hence to get credit on it and to participate in the grading of another student's work. (Only Valid DOCUMENTED Excuse will be allowed for missed peer grading and must be approved by instructor--evaluation process to be determined by instructor)
2. During the class session when peer grading is started, the professor will disscuss a "correct" solution with the class and you will use this and guidelines presented and discussed to grade the student's work. FOR THIS ASSIGNMENT you will demonstrate your work to your grader
3. As part of this we will explore different solutions done by students and unexpected logic errors and syntax errors.

Evaluation Guidelines

NOTE: the points on each item are given as full points if solution completely correct and 0 points if not (even if code attempted).