diff --git a/ASD_Task_2.depend b/ASD_Task_2.depend
index 4a87b2d..96287f7 100644
--- a/ASD_Task_2.depend
+++ b/ASD_Task_2.depend
@@ -29,3 +29,21 @@
 	"list.h"
 	"operation.h"
 
+1581242889 source:c:\users\asus\documents\github\asd_task_2\operation.cpp
+	"list.h"
+	"operation.h"
+
+1581237907 c:\users\asus\documents\github\asd_task_2\list.h
+	<iostream>
+
+1580831697 c:\users\asus\documents\github\asd_task_2\operation.h
+	"list.h"
+
+1581242548 source:c:\users\asus\documents\github\asd_task_2\main.cpp
+	<iostream>
+	"list.h"
+	"operation.h"
+
+1581242097 source:c:\users\asus\documents\github\asd_task_2\list.cpp
+	"list.h"
+
diff --git a/ASD_Task_2.layout b/ASD_Task_2.layout
index e69ac9c..e05be76 100644
--- a/ASD_Task_2.layout
+++ b/ASD_Task_2.layout
@@ -7,6 +7,11 @@
 			<Cursor1 position="656" 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">
+		<Cursor>
+			<Cursor1 position="152" topLine="0" />
+		</Cursor>
+	</File>
 	<File name="Main.cpp" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
 			<Cursor1 position="837" topLine="23" />
@@ -22,9 +27,4 @@
 			<Cursor1 position="214" topLine="117" />
 		</Cursor>
 	</File>
-	<File name="operation.h" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
-		<Cursor>
-			<Cursor1 position="152" topLine="0" />
-		</Cursor>
-	</File>
 </CodeBlocks_layout_file>
diff --git a/Main.cpp b/Main.cpp
index 297d6ca..d0d6ae0 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..470c3bf
Binary files /dev/null and b/bin/Debug/ASD_Task_2.exe differ
diff --git a/list.cpp b/list.cpp
index f61d73d..c107319 100644
--- a/list.cpp
+++ b/list.cpp
@@ -5,8 +5,8 @@ void createList(List &L) {
     * FS : set first(L) with Null
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
 
+  first(L) = NULL;
 
     //----------------------------------------
 }
@@ -18,8 +18,10 @@ address allocate(infotype x) {
 
     address P = NULL;
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
 
+     P = new elmlist;
+    info(P) = x;
+    next(P) = NULL;
 
     //----------------------------------------
     return P;
@@ -30,9 +32,7 @@ void deallocate(address &P) {
     * FS : delete element pointed by P
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    delete P;
     //----------------------------------------
 }
 
@@ -42,10 +42,9 @@ 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,17 @@ 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 temp=first(L);
+    if (temp!=NULL){
+        while (next(temp)!=NULL){
+            temp= next(temp);
+        }
+        next(temp)=P;
+    }else {
+        insertFirst(L,P);
+    }
     //----------------------------------------
 }
 
@@ -70,8 +77,10 @@ address findElm(List L, infotype x) {
 
     address P;
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    P=first(L);
+    while((next(P)!=NULL) && (info(P)!=x)){
+        P= next(P);
+    }
 
     //----------------------------------------
     return P;
@@ -83,8 +92,12 @@ 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 +109,18 @@ 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 temp= first(L);
+    if (next(temp)!=NULL){
+
+     P = next(temp);
+    while (next(P)!=NULL){
+        temp=next(temp);
+        P=next(temp);
+    }
+    next(temp)=NULL;
+    }else {
+        deleteFirst(L,P);
+    }
     //----------------------------------------
 }
 
@@ -109,7 +130,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;
+    cout<<"your code here :";
+    address p = first(L);
+    while (p != NULL){
+        cout << info(p)<<",";
+        p = next(p);
+    }
 
 
     //----------------------------------------
@@ -124,7 +150,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 +163,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..7fa1378 100644
--- a/list.h
+++ b/list.h
@@ -30,14 +30,15 @@ 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..e2ac483
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..3f4528c 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..c0d088e 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..984d854 100644
--- a/operation.cpp
+++ b/operation.cpp
@@ -13,8 +13,26 @@ 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 {
+        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)&& (findElm(L,x)==NULL)){
+                P = allocate(x);
+                Q = findElm(L,x);
+                insertAfter(L,Q,P);
+                }
 
+            }
+
+        }
 
     //----------------------------------------
 }