Merge pull request #7 from charmplusplus/ExerciseUpdates

OddEven Rephrasing

Author: AdvaitTahilyani

content/exercises/oddevensort.html

@@ -12,7 +12,7 @@
 
 <h1>Chare Arrays: Odd-Even Sort Exercise</h1>
 
-<p>A mainchare has a chare array of size N. Each chare in the array generates its own random number. The array must be sorted in N steps, where at each step, each chare may communicate with at most one of its neighbors (i.e. on an 'odd' step adjacent chares are paired in one fashion, and on an 'even' step the pairing is switched). No barriers are allowed, and there is only one reduction, at the end, which checks that the elements have been properly sorted.</p>
+<p>A mainchare has a chare array of size N. Each chare in the array generates its own random number, with a unique seed. The array must be sorted in N steps, where at each step, each chare may communicate with at most one of its neighbors (i.e. on an 'odd' step adjacent chares are paired in one fashion, and on an 'even' step the pairing is switched). No barriers are allowed, and there is only one reduction, at the end, which checks that the elements have been properly sorted. No global synchronizations are allowed during iterations, the objective of the assignment is to learn to handle asynchrony.</p>
 
 <p> For example: </p>
 <p> Even steps: 0--1  2--3  4--5  6--7 </p>