algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-05 16:27:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: enable MultipleVariableDeclarations in checkstyle (#5175)

Browse Source 
Co-authored-by: vaibhav <vaibhav.waghmare@techprescient.com>
This commit is contained in:
vaibhav9t1
2024-05-25 23:48:27 +05:30
committed by GitHub
parent 44ce6e7b0d
commit 9eaa2bb756
82 changed files with 299 additions and 121 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
src/main/java/com/thealgorithms/scheduling/SJFScheduling.java
View File

@ -24,7 +24,9 @@ public class SJFScheduling {
sortByArrivalTime();
}
protected void sortByArrivalTime() {
int size = processes.size(), i, j;
int size = processes.size();
int i;
int j;
ProcessDetails temp;
for (i = 0; i < size; i++) {
for (j = i + 1; j < size - 1; j++) {
@ -44,8 +46,12 @@ public class SJFScheduling {
public void scheduleProcesses() {
ArrayList<ProcessDetails> ready = new ArrayList<>();
int size = processes.size(), runtime, time = 0;
int executed = 0, j, k = 0;
int size = processes.size();
int runtime;
int time = 0;
int executed = 0;
int j;
int k = 0;
ProcessDetails running;
if (size == 0) {
@ -85,8 +91,11 @@ public class SJFScheduling {
if (ReadyProcesses.isEmpty()) {
return null;
}
int i, size = ReadyProcesses.size();
int minBurstTime = ReadyProcesses.get(0).getBurstTime(), temp, positionOfShortestJob = 0;
int i;
int size = ReadyProcesses.size();
int minBurstTime = ReadyProcesses.get(0).getBurstTime();
int temp;
int positionOfShortestJob = 0;
for (i = 1; i < size; i++) {
temp = ReadyProcesses.get(i).getBurstTime();