Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Muhammad Ghifari Adrian || 1301194034 #166

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

Muhammad Ghifari Adrian || 1301194034 #166

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
676a052
Update list.cpp
GhifariADR Feb 22, 2020
6e4d8ba
Update list.h
GhifariADR Feb 22, 2020
a353cea
Update main.cpp
GhifariADR Feb 22, 2020
8192c50
Update my_data.cpp
GhifariADR Feb 22, 2020
5597160
Update operation.cpp
GhifariADR Feb 22, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
72 changes: 72 additions & 0 deletions list.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,8 @@ void createList(List &L) {
*/
//-------------your code here-------------
your code here
first(L) = NULL;
last(L) == NULL;


//----------------------------------------
Expand All @@ -20,6 +22,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;


//----------------------------------------
Expand All @@ -32,6 +41,7 @@ void deallocate(address &P) {
*/
//-------------your code here-------------
your code here
delete P;


//----------------------------------------
Expand All @@ -44,6 +54,14 @@ void insertFirst(List &L, address P) {
*/
//-------------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;
}


//----------------------------------------
Expand All @@ -56,6 +74,9 @@ void insertLast(List &L, address P) {
*/
//-------------your code here-------------
your code here
next(last(L)) = P;
prev(P) = last(L);
last(L) = P;


//----------------------------------------
Expand All @@ -71,6 +92,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);
}


//----------------------------------------
Expand All @@ -84,6 +109,16 @@ void deleteFirst(List &L, address &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;
}



Expand All @@ -97,6 +132,16 @@ void deleteLast(List &L, address &P) {
*/
//-------------your code here-------------
your code here
if (last(L) != NULL) {
P = last(L);
last(L) = prev(P);
prev(P) = NULL;
next(last(L)) = NULL;
} else if (first(L) == last(L)) {
P = first(L);
first(L) = NULL;
last(L) = NULL;
}



Expand All @@ -110,6 +155,12 @@ void printInfo(List L) {
*/
//-------------your code here-------------
your code here
address P = first(L);
while (P != NULL) {
view_data(info(P));
P = next(P);
}
cout << endl;


//----------------------------------------
Expand All @@ -124,6 +175,16 @@ void insertAfter(List &L, address Prec, address P) {
*/
//-------------your code here-------------
your code here
if (first(L) == NULL) {
insertFirst(L, P);
} else if (first(L) != last(L) && Prec != NULL) {
next(P) = next(Prec);
P -> prev = Prec;
prev(next(Prec)) = P;
next(Prec) = P;
} else if (Prec != NULL) {
insertLast(L, P);
}

//----------------------------------------

Expand All @@ -136,6 +197,17 @@ void deleteAfter(List &L, address Prec, address &P) {
*/
//-------------your code here-------------
your code here
if (first(L) == last(L) && Prec != NULL) {
deleteFirst(L, P);
} else if (next(Prec) != last(L) && Prec != NULL) {
P = next(Prec);
next(Prec) = next(P);
prev(next(P)) = Prec;
next(P) = NULL;
prev(P) = NULL;
} else if (Prec != NULL) {
deleteLast(L, P);
}


//----------------------------------------
Expand Down
5 changes: 5 additions & 0 deletions list.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -37,12 +37,17 @@ typedef struct elmlist *address;

struct elmlist{
//------------- your code here -----------
infotype info;
address next;
address prev;

//----------------------------------------
};

struct List{
//------------- your code here -----------
address first;
address last;


//----------------------------------------
Expand Down
50 changes: 50 additions & 0 deletions main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -53,6 +53,56 @@ void mainMenu() {
P = allocate(X);
insertFirst(L,P)
break;
case 1:
X = create_data();
P = allocate(X);
insertFirst(L,P)
if (findElm(L, info(P)) == NULL) {
insertFirst(L, P);
}
break;
case 2:
printInfo(L);
break;
case 3:
cout << "Masukkan ID yang ingin dicari : ";
cin >> X.ID;
P = findElm(L, X);
if (P != NULL) {
view_data(info(P));
} else {
cout << "DATA TIDAK DITEMUKAN!\n";
}
break;
case 4:
cout << "Masukkan ID yang ingin diedit : ";
cin >> X.ID;
P = findElm(L, X);
if (P != NULL) {
edit_data(info(P));
} else {
cout << "DATA TIDAK DITEMUKAN!\n";
}
break;
case 5:
cout << "Masukkan ID yang ingin didelete : ";
cin >> X.ID;
if (findElm(L, X) != NULL) {
deletebyID(L, X.ID);
} else {
cout << "DATA TIDAK DITEMUKAN" << endl;
}
break;
case 6:
savePassedMember(L, L_passed);
break;
case 7:
printInfo(L_passed);
break;
}
if (choice == 0) {
break;
}
}
} while(true);

Expand Down
22 changes: 19 additions & 3 deletions my_data.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,9 +2,9 @@
#include "my_data.h"

/**
CLASS :
NAME :
STUDENT ID :
CLASS :IF-43-05
NAME :Muhammad Ghifari Adrian
STUDENT ID :1301194034
**/

mytype create_data() {
Expand All @@ -16,6 +16,15 @@ mytype create_data() {
// ===========================
// YOUR CODE HERE
your code here
cout << "Masukkan ID : ";
cin >> d.ID;
cout << "Masukkan Nama : ";
cin >> d.name;
cout << "Masukkan ranking : ";
cin >> d.rank;
cout << "Masukkan score : ";
cin >> d.score;




Expand All @@ -33,6 +42,7 @@ void view_data(mytype d) {
// ===========================
// YOUR CODE HERE
your code here
cout << d.ID << " - " << d.name << " - "<< d.rank << " - " << d.score << endl;



Expand All @@ -51,6 +61,12 @@ void edit_data(mytype &d) {
// ===========================
// YOUR CODE HERE
your code here
cout << "Masukkan pergantian nama : ";
cin >> d.name;
cout << "Masukkan pergantian rank : ";
cin >> d.rank;
cout << "Masukkan pergantian score : ";
cin >> d.score;



Expand Down
38 changes: 38 additions & 0 deletions operation.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,6 +15,17 @@ void insertAndSort(List &L, infotype x) {

//-------------your code here-------------
your code here
address p, p1;
p = first(L);
if (p == NULL || info(p).ID > x.ID) {
insertFirst(L, allocate(x));
} else if (findElm(L, x) == NULL) {
while (p != NULL && info(p).ID < x.ID) {
p1 = p;
p = next(p);
}
insertAfter(L, p1, allocate(x));
}


//----------------------------------------
Expand All @@ -30,6 +41,17 @@ void deletebyID(List &L, int id_x) {
address Prec, P;
//-------------your code here-------------
your code here
P = first(L);
if (P == first(L) && id_x == info(P).ID) {
deleteFirst(L, P);
} else {
while (P != NULL) {
if (id_x == info(P).ID && first(L) != last(L)) {
deleteAfter(L, prev(P), P);
}
P = next(P);
}
}


//----------------------------------------
Expand All @@ -44,6 +66,22 @@ void savePassedMember(List &L, List &L2){
address P;
//-------------your code here-------------
your code here
P = first(L);
address Q = P;
while (Q != NULL) {
P = Q;
if (info(P).score > 80) {
insertAndSort(L2, info(P));
Q = next(Q);
if (prev(P) == NULL) {
deleteFirst(L, P);
} else {
deleteAfter(L, prev(P), P);
}
} else {
Q = next(Q);
}
}


//----------------------------------------
Expand Down