Skip to content

PR from Berliana Shafa Wardani _1301194181_IF-43-05 #274

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

Open
BerlianaShafa wants to merge 1 commit into
base: master
Choose a base branch
from
Open

PR from Berliana Shafa Wardani _1301194181_IF-43-05 #274

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
18 changes: 18 additions & 0 deletions ASD_Task_2.depend
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,3 +29,21 @@
"list.h"
"operation.h"

1581161084 source:d:\tugas kuliah\github\asd_task_2\main.cpp
<iostream>
"list.h"
"operation.h"

1581157762 d:\tugas kuliah\github\asd_task_2\list.h
<iostream>

1581151586 d:\tugas kuliah\github\asd_task_2\operation.h
"list.h"

1581157612 source:d:\tugas kuliah\github\asd_task_2\operation.cpp
"list.h"
"operation.h"

1581160022 source:d:\tugas kuliah\github\asd_task_2\list.cpp
"list.h"

20 changes: 10 additions & 10 deletions ASD_Task_2.layout
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,29 +2,29 @@
<CodeBlocks_layout_file>
<FileVersion major="1" minor="0" />
<ActiveTarget name="Debug" />
<File name="operation.cpp" open="1" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="list.h" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="656" topLine="0" />
<Cursor1 position="144" topLine="35" />
</Cursor>
</File>
<File name="Main.cpp" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="Main.cpp" open="1" top="1" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="837" topLine="23" />
<Cursor1 position="1716" topLine="50" />
</Cursor>
</File>
<File name="list.h" open="1" top="1" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="list.cpp" open="1" top="0" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="151" topLine="0" />
<Cursor1 position="1715" topLine="103" />
</Cursor>
</File>
<File name="list.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="operation.h" open="0" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="214" topLine="117" />
<Cursor1 position="152" topLine="0" />
</Cursor>
</File>
<File name="operation.h" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="operation.cpp" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="152" topLine="0" />
<Cursor1 position="478" topLine="21" />
</Cursor>
</File>
</CodeBlocks_layout_file>
2 changes: 1 addition & 1 deletion Main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -34,7 +34,7 @@ int main() {
//==================================================
// TEST INSERT AFTER
P = findElm(L, 6);
insertLast(L, allocate(5));
insertAfter(L, P, allocate(5));
printInfo(L);
cout<<"output should be: 8, 3, 6, 5, 4, 2,"<<endl;

Expand Down
Binary file added bin/Debug/ASD_Task_2.exe
View file
Open in desktop
Binary file not shown.
112 changes: 48 additions & 64 deletions list.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,64 +1,38 @@
#include "list.h"

void createList(List &L) {
/**
* FS : set first(L) with Null
*/
//-------------your code here-------------
cout<<"your code here"<<endl;


//----------------------------------------
first(L) = NULL;
}

address allocate(infotype x) {
/**
* FS : return new list element with info = x and next element is Null
*/

address P = NULL;
//-------------your code here-------------
cout<<"your code here"<<endl;
P = new elmlist;
info(P) = x;
next(P) = NULL;


//----------------------------------------
return P;
}

void deallocate(address &P) {
/**
* FS : delete element pointed by P
*/
//-------------your code here-------------
cout<<"your code here"<<endl;


//----------------------------------------
delete P;
}

void insertFirst(List &L, address P) {
/**
* IS : List L may be empty
* FS : element pointed by P became the first element in List L
*/
//-------------your code here-------------
cout<<"your code here"<<endl;



//----------------------------------------
next(P) = first(L);
first(L) = P;
}

void insertLast(List &L, address P) {
/**
* IS : List L may be empty
* FS : element pointed by P became the last element in List L
*/
//-------------your code here-------------
cout<<"your code here"<<endl;


//----------------------------------------
address Q = first(L);
while (next(Q) != NULL)
{
Q = next(Q);
}
next(Q)=P;
}

address findElm(List L, infotype x) {
Expand All @@ -70,9 +44,11 @@ address findElm(List L, infotype x) {

address P;
//-------------your code here-------------
cout<<"your code here"<<endl;


P = first(L);
while ((P != NULL) && (x != info(P)))
{
P = next(P);
}
//----------------------------------------
return P;
}
Expand All @@ -82,37 +58,45 @@ void deleteFirst(List &L, address &P) {
* IS : List L may be empty
* FS : first element in List L is removed and is pointed by P
*/
//-------------your code here-------------
cout<<"your code here"<<endl;



//----------------------------------------
if (first(L) != NULL) {
P = first(L);
first(L) = next(P);
next(P) = NULL;
}
}

void deleteLast(List &L, address &P) {
/**
* IS : List L may be empty
* FS : last element in List L is removed and is pointed by P
*/
//-------------your code here-------------
cout<<"your code here"<<endl;



//----------------------------------------
address Q;
Q = first(L);
if (next(Q) == NULL)
first(L)=NULL;
else
{
while (next(next(Q)) != NULL)
{
Q = next(Q);
}
P = next(Q);
next(Q) = NULL;
}
}

void printInfo(List L) {
/**
* FS : view info of all element inside List L,
* call the view_data function from my_data.h to print the info
*/
//-------------your code here-------------
cout<<"your code here"<<endl;


//----------------------------------------
address p;
p = first(L);
while (p != NULL)
{
cout<<info(p)<<" - " ;
p = next(p);
}
cout<<endl;
}

Expand All @@ -124,8 +108,8 @@ void insertAfter(List &L, address Prec, address P) {
* pointed by pointer Prec
*/
//-------------your code here-------------
cout<<"your code here"<<endl;

next(P) = next(Prec);
next(Prec) = P;
//----------------------------------------

}
Expand All @@ -136,9 +120,9 @@ void deleteAfter(List &L, address Prec, address &P) {
* is removed and pointed by pointer P
*/
//-------------your code here-------------
cout<<"your code here"<<endl;


P = next(Prec);
next(Prec) = next(P);
next(P) = NULL;
//----------------------------------------
}

10 changes: 3 additions & 7 deletions list.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,16 +29,12 @@ typedef int infotype;
typedef struct elmlist *address;

struct elmlist{
//------------- your code here -----------


//----------------------------------------
infotype info;
address next;
};

struct List{
//------------- your code here -----------

//----------------------------------------
address first;
};


Expand Down
Binary file added obj/Debug/Main.o
View file
Open in desktop
Binary file not shown.
Binary file modified obj/Debug/list.o
View file
Open in desktop
Binary file not shown.
Binary file modified obj/Debug/operation.o
View file
Open in desktop
Binary file not shown.
30 changes: 28 additions & 2 deletions operation.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,33 @@ void insert_sorted(List &L, infotype x) {

//-------------your code here-------------
cout<<"your code here"<<endl;


address Q, P;
P = allocate(x);
if (first(L) == NULL)
{
insertFirst(L,P);
}
else
{
Q= first(L);
while ( next(Q) != NULL && x>info(Q))
{
Q = next(Q);
}
if (info(Q) != x)
{
if (x>info(Q))
{
insertLast(L,P);
}
else if (x<info(Q))
{
insertFirst(L,P);
}else
{
insertAfter(L, Q, P);
}
}
}
//----------------------------------------
}