Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <conio.h>
- #define maks 20
- int i,j,n,arr[maks],burst[maks],proses[maks];
- void sortirarr(void);
- void sortirburst(void);
- main() {
- int totalwaktu = 0, totalwait = 0;
- puts("============ Shortest Job First =============");
- printf(" Masukkan jumlah proses = "); scanf("%d", &n);
- puts("=============================================");
- for(i=0;i<n;i++) {
- proses[i] = i + 1;
- printf(" Proses ke-%d\n",proses[i]);
- puts("---------------------------------------------");
- printf(" > Arrival Time : ");
- scanf("%d", &arr[i]);
- printf(" > Burst Time : ");
- scanf("%d", &burst[i]);
- puts("---------------------------------------------");
- }
- sortirarr();
- sortirburst();
- totalwaktu = arr[0];
- puts("\n=============================================");
- printf("| Proses | Waktu Awal | Burst | Waktu Akhir |\n");
- puts("=============================================");
- for(i=0;i<n;i++) {
- printf("| P%-5d | %-10d | %-5d | %-11d |\n",proses[i],totalwaktu,burst[i],(totalwaktu+burst[i]));
- totalwaktu += burst[i];
- if((i+1) < n)
- totalwait += totalwaktu;
- }
- puts("=============================================");
- printf(" > Average Waiting time : %d\n", totalwait/n);
- }
- void sortirburst(void) {
- int temparr,tempproses,tempburst;
- for(i=0;i<n;i++){
- for(j=1;j<n-1;j++){
- if (burst[j] > burst[j+1]) {
- tempproses = proses[j];
- proses[j] = proses[j+1];
- proses[j+1] = tempproses;
- temparr = arr[j];
- arr[j] = arr[j+1];
- arr[j+1] = temparr;
- tempburst = burst[j];
- burst[j] = burst[j+1];
- burst[j+1] = tempburst;
- }
- }
- }
- }
- void sortirarr(void) {
- int temparr,tempproses,tempburst;
- for(i=0;i<n;i++){
- for(j=0;j<n-1;j++){
- if (arr[j] > arr[j+1]) {
- tempproses = proses[j];
- proses[j] = proses[j+1];
- proses[j+1] = tempproses;
- temparr = arr[j];
- arr[j] = arr[j+1];
- arr[j+1] = temparr;
- tempburst = burst[j];
- burst[j] = burst[j+1];
- burst[j+1] = tempburst;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement