I need to insert an Appointment in a Planner class that takes Appointment A1 as a parameter and places A1 in proper order to an array Appoint. I have already created the Array which only has 4 default appointments and has a length of 20. I also created a method to compare two objects of the Array and return true if A1 is smaller than A2. I have a method which allows me to insert info into the Array if array[i{ = null. However I have no idea how to sort it as I have to shift elements not sort the entire array
Asked
Active
Viewed 91 times
1
-
Basically you want to maintain an always sorted list? So this answer should help - https://stackoverflow.com/questions/4903611/java-list-sorting-is-there-a-way-to-keep-a-list-permantly-sorted-automatically – spinlok Mar 05 '18 at 08:02
-
`Arrays.sort(array, comparator)` – Aniket Sahrawat Mar 05 '18 at 08:16
-
https://docs.oracle.com/javase/7/docs/api/java/util/SortedSet.html – Luk Mar 05 '18 at 09:08
-
" I have to shift elements not sort the entire array" - why not sort ? – c0der Mar 05 '18 at 09:42
-
Teacher won’t allow me – Alexis Flanigan Mar 06 '18 at 05:19
2 Answers
0
As I have learned to code and taken more classes I've realized the answer. The array of appointments needs to be a String array and as you move into inserting new appointments compare the first three letters, then the numbers, then years. At the time I used a huge nested if else loop. As each date is a set amount of letters (3 for month, 2 day, 4 year) it is quite simple and simply push the other dates down if needed. Although I believe for this project the dates it never went above 20, I would put an error message so the code doesn't crash when being tested.
Alexis Flanigan
- 61
- 1
- 2
- 9
0
You'd better use a PriorityQueue instead of an Array. The PriorityQueue is based on a priority heap, once you add an element it will be shifted up/down the tree which takes O(log(N)) time complexity. If you shift an element in Array, it will take O(N).
Leo Xu
- 174
- 3
- 11