diff --git a/ASD_Task_3.depend b/ASD_Task_3.depend index 831bfcc..d57d1b6 100644 --- a/ASD_Task_3.depend +++ b/ASD_Task_3.depend @@ -52,3 +52,31 @@ "operation.h" "my_data.h" +1582438463 source:d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\list.cpp + "list.h" + "my_data.h" + +1582435213 d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\list.h + + "my_data.h" + +1582433367 d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\my_data.h + + +1582435929 source:d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\main.cpp + + "list.h" + "operation.h" + "my_data.h" + +1582403452 d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\operation.h + "list.h" + +1582433848 source:d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\my_data.cpp + "my_data.h" + +1582437080 source:d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\operation.cpp + "list.h" + "operation.h" + "my_data.h" + diff --git a/ASD_Task_3.layout b/ASD_Task_3.layout index 17b1801..e2e5153 100644 --- a/ASD_Task_3.layout +++ b/ASD_Task_3.layout @@ -2,39 +2,39 @@ - + - + - + - + - + - + - + - + - + - + - + - + - + - + diff --git a/bin/Debug/ASD_Task_3.exe b/bin/Debug/ASD_Task_3.exe new file mode 100644 index 0000000..384154d Binary files /dev/null and b/bin/Debug/ASD_Task_3.exe differ diff --git a/list.cpp b/list.cpp index fe0655c..22d8da3 100644 --- a/list.cpp +++ b/list.cpp @@ -6,7 +6,8 @@ void createList(List &L) { * FS : set first(L) and last(L) with Null */ //-------------your code here------------- - your code here + first(L) = NULL; + last(L) = NULL; //---------------------------------------- @@ -19,9 +20,13 @@ address allocate(infotype x) { address P; //-------------your code here------------- - your code here - - + P = new elmlist; + info(P).ID = x.ID; + info(P).name = x.name; + info(P).rank = x.rank; + info(P).score = x.score; + next(P) = NULL; + prev(P) = NULL; //---------------------------------------- return P; } @@ -31,9 +36,7 @@ void deallocate(address &P) { * FS : delete element pointed by P */ //-------------your code here------------- - your code here - - + delete P; //---------------------------------------- } @@ -43,9 +46,14 @@ void insertFirst(List &L, address P) { * FS : element pointed by P became the first element in List L */ //-------------your code here------------- - your code here - - + if (first(L) != NULL){ + next(P) = first(L); + prev(first(L)) = P; + first(L) = P; + }else { + first(L) = P; + last(L) = P; + } //---------------------------------------- } @@ -55,9 +63,9 @@ void insertLast(List &L, address P) { * FS : element pointed by P became the last element in List L */ //-------------your code here------------- - your code here - - + next(last(L)) = P; + prev(P) = last(L); + last(L) = P; //---------------------------------------- } @@ -70,9 +78,10 @@ address findElm(List L, infotype x) { address P; //-------------your code here------------- - your code here - - + P = first(L); + while(P != NULL && info(P).ID != x.ID){ + P = next(P); + } //---------------------------------------- return P; } @@ -83,10 +92,16 @@ void deleteFirst(List &L, address &P) { * FS : first element in List L is removed and is pointed by P */ //-------------your code here------------- - your code here - - - + if (first(L) == last(L)){ + P = first(L); + first(L) = NULL; + last(L) = NULL; + }else if (first(L) != NULL){ + P = first(L); + first(L) = next(P); + next(P) = NULL; + prev(first(L)) = NULL; + } //---------------------------------------- } @@ -96,10 +111,16 @@ void deleteLast(List &L, address &P) { * FS : last element in List L is removed and is pointed by P */ //-------------your code here------------- - your code here - - - + if (first(L) == last(L)){ + P = first(L); + first(L) = NULL; + last(L) = NULL; + } else if (last(L) != NULL){ + P = last(L); + last(L) = prev(P); + prev(P) = NULL; + next(last(L)) = NULL; + } //---------------------------------------- } @@ -109,9 +130,13 @@ void printInfo(List L) { * call the view_data function from my_data.h to print the info */ //-------------your code here------------- - your code here - - + address P; + P = first(L); + while (P != NULL){ + view_data(info(P)); + P = next(P); + } + cout< * -* Type List : < -* first : address -* last : address +* Type List : < +* first : address +* last : address * > * **/ @@ -37,14 +37,16 @@ typedef struct elmlist *address; struct elmlist{ //------------- your code here ----------- - + infotype info; + address next; + address prev; //---------------------------------------- }; struct List{ //------------- your code here ----------- - - + address first; + address last; //---------------------------------------- }; diff --git a/main.cpp b/main.cpp index 9e0b483..6ceb7f7 100644 --- a/main.cpp +++ b/main.cpp @@ -20,7 +20,7 @@ int main() { void mainMenu() { address P; - infotype X; + infotype H; /** * IS : List has been created * PR : prints menu to user @@ -49,10 +49,60 @@ void mainMenu() { cin>>choice; switch(choice) { case 1: - X = create_data(); - P = allocate(X); - insertFirst(L,P) + H = create_data(); + insertAndSort(L,H); break; + case 2: + printInfo(L); + break; + case 3: + cout << "Masukkan ID: "; + cin >> H.ID; + P = findElm(L, H); + if (P != NULL) + { + view_data(info(P)); + } + else + { + cout << "ID Data yang anda cari tidak ada\n"; + } + break; + case 4: + cout << "Masukkan ID: "; + cin >> H.ID; + P = findElm(L, H); + if (P != NULL) + { + edit_data(info(P)); + } + else + { + cout << "ID Data yang anda cari tidak ada\n"; + } + break; + case 5: + cout << "Masukkan ID: "; + cin >> H.ID; + if (findElm(L, H) != NULL) + { + deletebyID(L, H.ID); + } + else + { + cout << "Not Found" << endl; + } + break; + case 6: + savePassedMember(L, L_passed); + cout<<"Member yang LULUS udah selesai"<>d.ID; + cout<<"Masukkan Nama ; "; + cin>>d.name; + cout<<"Masukkan Ranking ; "; + cin>>d.rank; + cout<<"Masukkan Score ; "; + cin>>d.score; // =========================== return d; } @@ -32,11 +35,11 @@ void view_data(mytype d) { // =========================== // YOUR CODE HERE - your code here - - - - + cout<<"ID Member : "<>d.name; + cout<<"Masukkan Rank Pengganti : "; + cin>>d.rank; + cout<<"Masukkan Score Pengganti : "; + cin>>d.score; // =========================== } diff --git a/my_data.h b/my_data.h index 2937b48..6ba0145 100644 --- a/my_data.h +++ b/my_data.h @@ -5,9 +5,9 @@ using namespace std; /** - CLASS : - NAME : - STUDENT ID : + CLASS : IF - 43 - 05 + NAME : Hassan Rizky Putra Sailellah + STUDENT ID : 1301190328 **/ struct mytype { @@ -20,8 +20,10 @@ struct mytype { */ //================================================= // YOUR CODE STARTS HERE - your code here - + int ID; + string name; + int rank; + float score; // YOUR CODE ENDS HERE //================================================= }; @@ -29,6 +31,6 @@ struct mytype { mytype create_data(); void view_data(mytype d); -void edit_data(mytype &d); +void edit_data(mytype &d); #endif // MY_DATA_H_INCLUDED diff --git a/obj/Debug/list.o b/obj/Debug/list.o new file mode 100644 index 0000000..456fb62 Binary files /dev/null and b/obj/Debug/list.o differ diff --git a/obj/Debug/main.o b/obj/Debug/main.o new file mode 100644 index 0000000..bf97f90 Binary files /dev/null and b/obj/Debug/main.o differ diff --git a/obj/Debug/my_data.o b/obj/Debug/my_data.o new file mode 100644 index 0000000..9bfd105 Binary files /dev/null and b/obj/Debug/my_data.o differ diff --git a/obj/Debug/operation.o b/obj/Debug/operation.o new file mode 100644 index 0000000..1d2154a Binary files /dev/null and b/obj/Debug/operation.o differ diff --git a/operation.cpp b/operation.cpp index c2dc0b0..fe853cf 100644 --- a/operation.cpp +++ b/operation.cpp @@ -1,7 +1,7 @@ #include "list.h" #include "operation.h" #include "my_data.h" - + void insertAndSort(List &L, infotype x) { /** @@ -14,9 +14,19 @@ void insertAndSort(List &L, infotype x) { */ //-------------your code here------------- - your code here - - + address Prec; + Prec = first(L); + if (Prec == NULL || info(first(L)).ID >= x.ID){ + insertFirst(L, allocate(x)); + }else if(info(last(L)).ID < x.ID){ + insertLast(L, allocate(x)); + }else{ + while(Prec != NULL && info(Prec).ID = 80){ + insertFirst(L2, allocate(info(P))); + } + P = next(P); + } //---------------------------------------- }