diff --git a/ASD_Task_2.depend b/ASD_Task_2.depend
index 4a87b2d..8334dc5 100644
--- a/ASD_Task_2.depend
+++ b/ASD_Task_2.depend
@@ -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"
+
diff --git a/ASD_Task_2.layout b/ASD_Task_2.layout
index e69ac9c..167f34b 100644
--- a/ASD_Task_2.layout
+++ b/ASD_Task_2.layout
@@ -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>
diff --git a/Main.cpp b/Main.cpp
index 297d6ca..f3dfaf8 100644
--- a/Main.cpp
+++ b/Main.cpp
@@ -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;
 
diff --git a/bin/Debug/ASD_Task_2.exe b/bin/Debug/ASD_Task_2.exe
new file mode 100644
index 0000000..684355d
Binary files /dev/null and b/bin/Debug/ASD_Task_2.exe differ
diff --git a/list.cpp b/list.cpp
index f61d73d..3fe2655 100644
--- a/list.cpp
+++ b/list.cpp
@@ -1,52 +1,25 @@
 #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) {
@@ -54,11 +27,12 @@ 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) {
@@ -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;
 }
@@ -82,12 +58,11 @@ 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) {
@@ -95,12 +70,19 @@ 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) {
@@ -108,11 +90,13 @@ 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;
 }
 
@@ -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;
     //----------------------------------------
 
 }
@@ -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;
     //----------------------------------------
 }
 
diff --git a/list.h b/list.h
index d021225..e7d11d2 100644
--- a/list.h
+++ b/list.h
@@ -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;
 };
 
 
diff --git a/obj/Debug/Main.o b/obj/Debug/Main.o
new file mode 100644
index 0000000..3fc8361
Binary files /dev/null and b/obj/Debug/Main.o differ
diff --git a/obj/Debug/list.o b/obj/Debug/list.o
index f0e2f8e..6b6e636 100644
Binary files a/obj/Debug/list.o and b/obj/Debug/list.o differ
diff --git a/obj/Debug/operation.o b/obj/Debug/operation.o
index b08b1f9..c35261b 100644
Binary files a/obj/Debug/operation.o and b/obj/Debug/operation.o differ
diff --git a/operation.cpp b/operation.cpp
index 0a0e067..450c10d 100644
--- a/operation.cpp
+++ b/operation.cpp
@@ -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);
+            }
+        }
+    }
     //----------------------------------------
 }