/Users/johnr/Desktop/IA pdf Downloads/Criteria__P__-_Coding_Project_Upload_all_2022-05-03/Official_IA_Ish_04_21/src/main/java/com/mycompany/official_ia_ish/SortAndSearch.java |
1
2
3
4
5
6 package com.mycompany.official_ia_ish;
7
8 import java.util.LinkedList;
9
10
11
12 @author
13
14 public class SortAndSearch {
15
16 public void sortByUrgency(LinkedList<Task> tasksList){
17 int n = tasksList.size();
18 boolean sorted = false;
19 while(!sorted){
20 n--;
21 sorted = true;
22 for(int i = 0; i < n; i++){
23 if(tasksList.get(i).getTaskUrgency().charAt(0) < tasksList.get(i+1).getTaskUrgency().charAt(0)){
24
25 Task temp = tasksList.get(i);
26 tasksList.set(i, tasksList.get(i+1));
27 tasksList.set(i+1, temp);
28 sorted = false;
29 }
30 }
31 }
32 }
33
34 public void sortByDaysRemaining(LinkedList<Task> tasksList){
35 int o = tasksList.size();
36 boolean sorted = false;
37 while(!sorted){
38 o--;
39 sorted = true;
40 for(int i = 0; i < o; i++){
41 if(tasksList.get(i).getDaysRemaining().charAt(0) > tasksList.get(i+1).getDaysRemaining().charAt(0)){
42 Task temp = tasksList.get(i);
43 tasksList.set(i, tasksList.get(i+1));
44 tasksList.set(i+1, temp);
45 sorted = false;
46 }
47 }
48 }
49
50
51 }
52
53 public void sortByPrepTime(LinkedList<Task> tasksList){
54 int m = tasksList.size();
55 boolean sorted = false;
56 while(!sorted){
57 m--;
58 sorted = true;
59 for(int i = 0; i < m; i++){
60 if(tasksList.get(i).getPrepTime().charAt(0) < tasksList.get(i+1).getPrepTime().charAt(0)){
61 Task temp = tasksList.get(i);
62 tasksList.set(i, tasksList.get(i+1));
63 tasksList.set(i+1, temp);
64 sorted = false;
65 }
66 }
67 }
68
69 }
70
71
72 }
73