diff --git a/ASD_Task_2.depend b/ASD_Task_2.depend
index 4a87b2d..874ee7d 100644
--- a/ASD_Task_2.depend
+++ b/ASD_Task_2.depend
@@ -29,3 +29,21 @@
 	"list.h"
 	"operation.h"
 
+1581182896 source:c:\users\asus\documents\github\asd_task_2\main.cpp
+	<iostream>
+	"list.h"
+	"operation.h"
+
+1581049061 c:\users\asus\documents\github\asd_task_2\list.h
+	<iostream>
+
+1580936410 c:\users\asus\documents\github\asd_task_2\operation.h
+	"list.h"
+
+1581237784 source:c:\users\asus\documents\github\asd_task_2\list.cpp
+	"list.h"
+
+1581258007 source:c:\users\asus\documents\github\asd_task_2\operation.cpp
+	"list.h"
+	"operation.h"
+
diff --git a/ASD_Task_2.layout b/ASD_Task_2.layout
index e69ac9c..fc0014f 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="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="656" topLine="0" />
+			<Cursor1 position="423" topLine="27" />
 		</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="operation.cpp" open="1" top="1" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="837" topLine="23" />
+			<Cursor1 position="660" topLine="14" />
 		</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="Main.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="151" topLine="0" />
+			<Cursor1 position="2316" 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.h" open="0" top="0" tabpos="4" 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="list.cpp" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="-1" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="152" topLine="0" />
+			<Cursor1 position="2912" topLine="0" />
 		</Cursor>
 	</File>
 </CodeBlocks_layout_file>
diff --git a/Main.cpp b/Main.cpp
index 297d6ca..a172b0a 100644
--- a/Main.cpp
+++ b/Main.cpp
@@ -6,7 +6,7 @@ using namespace std;
 
 void mainMenu();
 List L;
-address P;
+address P, Prec;
 infotype X;
 
 int main() {
@@ -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..4c748f1
Binary files /dev/null and b/bin/Debug/ASD_Task_2.exe differ
diff --git a/list.cpp b/list.cpp
index f61d73d..d7cf1c2 100644
--- a/list.cpp
+++ b/list.cpp
@@ -1,67 +1,81 @@
 #include "list.h"
 
-void createList(List &L) {
+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) {
+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) {
+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) {
+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;
-
+    //cout<<"your code here"<<endl;
+    next(P) = first(L);
+    first(L) = P;
 
 
     //----------------------------------------
 }
 
-void insertLast(List &L, address 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;
+    Q = first(L);
+    if (Q==NULL){
+        insertFirst(L, P);
+    }else {
+        while(next(Q) != NULL)
+        {
+                Q = next(Q);
+        }
+            next(Q) = P;
+    }
 }
+//----------------------------------------
 
-address findElm(List L, infotype x) {
+
+address findElm(List L, infotype x)
+{
     /**
     * IS : List L may be empty
     * FS : returns element with info.ID = x.ID,
@@ -70,75 +84,105 @@ 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;
 }
 
-void deleteFirst(List &L, address &P) {
+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) {
+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) {
+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;
 }
 
 
-void insertAfter(List &L, address Prec, address P) {
+void insertAfter(List &L, address Prec, address P)
+{
     /**
     * IS : Prec and P is not NULL
     * FS : element pointed by P is placed behind the element
     *      pointed by pointer Prec
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    if (next(Prec)!=NULL){
+    next(P)=next(Prec);
+    next(Prec)=P;
+    }
     //----------------------------------------
 
 }
-void deleteAfter(List &L, address Prec, address &P) {
+void deleteAfter(List &L, address Prec, address &P)
+{
     /**
     * IS : Prec is not NULL
     * FS : element which was before behind an element pointed by Prec
     *      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..5e6dcbe
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..52620bc 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..a9e86b2 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..3c480e2 100644
--- a/operation.cpp
+++ b/operation.cpp
@@ -2,7 +2,8 @@
 #include "operation.h"
 
 
-void insert_sorted(List &L, infotype x) {
+void insert_sorted(List &L, infotype x)
+{
     /**
     * IS : List may be empty
     * PR : insert an infotype x into an already sorted List L
@@ -13,8 +14,23 @@ void insert_sorted(List &L, infotype x) {
     */
 
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    address P, Q;
+    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);
+            }
+        }
+    }
 
     //----------------------------------------
 }