diff --git a/ASD_Task_2.depend b/ASD_Task_2.depend
index 4a87b2d..1c258e7 100644
--- a/ASD_Task_2.depend
+++ b/ASD_Task_2.depend
@@ -29,3 +29,21 @@
 	"list.h"
 	"operation.h"
 
+1580918018 source:d:\informatika\semester 2\struktur data\asd_task_2\list.cpp
+	"list.h"
+
+1580912866 d:\informatika\semester 2\struktur data\asd_task_2\list.h
+	<iostream>
+
+1581011674 source:d:\informatika\semester 2\struktur data\asd_task_2\operation.cpp
+	"list.h"
+	"operation.h"
+
+1580803859 d:\informatika\semester 2\struktur data\asd_task_2\operation.h
+	"list.h"
+
+1581006775 source:d:\informatika\semester 2\struktur data\asd_task_2\main.cpp
+	<iostream>
+	"list.h"
+	"operation.h"
+
diff --git a/ASD_Task_2.layout b/ASD_Task_2.layout
index e69ac9c..2c0d3dd 100644
--- a/ASD_Task_2.layout
+++ b/ASD_Task_2.layout
@@ -2,27 +2,27 @@
 <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="Main.cpp" 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="2508" topLine="74" />
 		</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="list.cpp" open="1" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="837" topLine="23" />
+			<Cursor1 position="311" topLine="0" />
 		</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.h" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="151" topLine="0" />
+			<Cursor1 position="126" topLine="0" />
 		</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.cpp" open="1" top="1" tabpos="3" split="0" active="1" splitpos="0" zoom_1="-1" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="214" topLine="117" />
+			<Cursor1 position="826" topLine="6" />
 		</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.h" open="1" top="0" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
 			<Cursor1 position="152" topLine="0" />
 		</Cursor>
diff --git a/Main.cpp b/Main.cpp
index 297d6ca..d55720c 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..ec22dd1
Binary files /dev/null and b/bin/Debug/ASD_Task_2.exe differ
diff --git a/list.cpp b/list.cpp
index f61d73d..f0dd691 100644
--- a/list.cpp
+++ b/list.cpp
@@ -5,9 +5,7 @@ void createList(List &L) {
     * FS : set first(L) with Null
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+   first(L) = NULL;
     //----------------------------------------
 }
 
@@ -18,7 +16,9 @@ address allocate(infotype x) {
 
     address P = NULL;
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
+    P = new elmlist;
+    info(P) = x;
+    next(P) = NULL;
 
 
     //----------------------------------------
@@ -30,8 +30,7 @@ void deallocate(address &P) {
     * FS : delete element pointed by P
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    delete P;
 
     //----------------------------------------
 }
@@ -42,8 +41,8 @@ void insertFirst(List &L, address P) {
     * 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;
 
 
     //----------------------------------------
@@ -55,9 +54,12 @@ void insertLast(List &L, address P) {
     * FS : element pointed by P became the last element in List L
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    address Q;
+    Q = first(L);
+    while(next(Q)!=NULL){
+        Q = next(Q);
+    }
+    next(Q)= P;
     //----------------------------------------
 }
 
@@ -70,9 +72,11 @@ address findElm(List L, infotype x) {
 
     address P;
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    P = first(L);
 
+    while ((P != NULL ) && (info(P)!= x)){
+        P = next(P);
+    }
     //----------------------------------------
     return P;
 }
@@ -83,10 +87,11 @@ void deleteFirst(List &L, address &P) {
     * 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;
+    }
     //----------------------------------------
 }
 
@@ -96,10 +101,17 @@ void deleteLast(List &L, address &P) {
     * 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){
+       deleteFirst(L,P);
+    } else {
+        while (next(next(Q))!= NULL ){
+            Q = next(Q);
+        }
+        P = next(Q);
+        next(Q) = NULL;
+    }
     //----------------------------------------
 }
 
@@ -109,9 +121,12 @@ void printInfo(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,7 +139,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,7 +152,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..be28827 100644
--- a/list.h
+++ b/list.h
@@ -30,14 +30,14 @@ 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..4a651f1
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..08ff6f9 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..6d1ba8b 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..0168a2f 100644
--- a/operation.cpp
+++ b/operation.cpp
@@ -13,8 +13,23 @@ void insert_sorted(List &L, infotype x) {
     */
 
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
 
+    address Q,P;
+    if ((first(L) == NULL) || (x < info(first(L)))) {
+        P = allocate(x);
+        insertFirst(L,P);
+    } else if (findElm(L,x)==NULL){
+        Q = first(L);
+        while ((next(Q)!= NULL) && (x > info(next(Q)))){
+            Q = next(Q);
+            if (next(Q) == NULL){
+                P = allocate(x);
+                insertLast(L,P);
+            }else if (info(P)!=info(Q)){
+                P = allocate(x);
+                insertAfter(L,Q,P);
+                }
+            }
+        }
     //----------------------------------------
 }