1 
 2 /**
 3  *
 4  * @author 19314
 5  */
 6 public class SortingAndSearching {
 7     
 8     public void sortByDifficulty(Task [] scheduleArray) {
 9      int n = scheduleArray.length;
10      boolean sorted = false;
11      while (!sorted) {
12           n--; 
13           sorted = true;  
14           for (int i=0; i < n; i++) {
15                if (scheduleArray[i].getDifficulty() > scheduleArray[i+1].getDifficulty()) {
16                     Task temp = scheduleArray[i];  
17                     scheduleArray[i] = scheduleArray[i+1];  
18                     scheduleArray[i+1] = temp;
19                     sorted = false; 
20                }
21           }
22      }
23   }
24     
25     public void sortByTime(Task [] scheduleArray) {
26      int n = scheduleArray.length;
27      boolean sorted = false;
28      while (!sorted) {
29           n--; 
30           sorted = true;  
31           for (int i=0; i < n; i++) {
32                if (scheduleArray[i].getTime() > scheduleArray[i+1].getTime()) {
33                     Task temp = scheduleArray[i];  
34                     scheduleArray[i] = scheduleArray[i+1];  
35                     scheduleArray[i+1] = temp;
36                     sorted = false;
37                 }
38                
39             }
40         }
41     }
42 }
43