diff --git a/ASD_Task_2.layout b/ASD_Task_2.layout
index e69ac9c..1383d5b 100644
--- a/ASD_Task_2.layout
+++ b/ASD_Task_2.layout
@@ -4,27 +4,27 @@
 	<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">
 		<Cursor>
-			<Cursor1 position="656" topLine="0" />
+			<Cursor1 position="0" topLine="1" />
 		</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" />
+			<Cursor1 position="2649" topLine="75" />
 		</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="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="151" topLine="0" />
+			<Cursor1 position="75" topLine="19" />
 		</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="1" top="1" 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="list.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="152" topLine="0" />
+			<Cursor1 position="417" topLine="6" />
 		</Cursor>
 	</File>
 </CodeBlocks_layout_file>
diff --git a/list.cpp b/list.cpp
index f61d73d..2d98e44 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;
     //----------------------------------------
 }
 
@@ -15,12 +13,11 @@ 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;
 }
@@ -30,9 +27,7 @@ void deallocate(address &P) {
     * FS : delete element pointed by P
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    delete P;
     //----------------------------------------
 }
 
@@ -42,10 +37,10 @@ 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;
-
-
-
+    if(first(L)!=NULL){
+        next(P)=first(L);
+    }
+    first(L)=P;
     //----------------------------------------
 }
 
@@ -55,9 +50,16 @@ 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 Prec;
+    Prec=first(L);
+    if (first(L)== NULL){
+        insertFirst(L,P);
+    }else {
+        while (next(Prec) != NULL){
+            Prec=next(Prec);
+        }
+        insertAfter(L,Prec,P);
+    }
     //----------------------------------------
 }
 
@@ -70,9 +72,10 @@ 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 +86,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;
-
-
-
+    P=first(L);
+    if (next(P) != NULL){
+        first(L)=next(P);
+    } else {
+        first(L)=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 Prec;
+    Prec=first(L);
+    if (next(Prec)== NULL){
+        first(L) = NULL;
+    } else {
+        while (next(next(Prec)) != NULL){
+               Prec=next(Prec);
+        }
+        P = next(Prec);
+        next(Prec) = 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,8 +139,10 @@ void insertAfter(List &L, address Prec, address P) {
     *      pointed by pointer Prec
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    if (next(Prec)!=NULL){
+        next(P)=next(Prec);
+    }
+    next(Prec)=P;
     //----------------------------------------
 
 }
@@ -136,9 +153,12 @@ 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);
+    if (next(P)!=NULL){
+        next(Prec)=next(P);
+    } else{
+        next(Prec)=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/operation.cpp b/operation.cpp
index 0a0e067..0cdda40 100644
--- a/operation.cpp
+++ b/operation.cpp
@@ -13,8 +13,24 @@ void insert_sorted(List &L, infotype x) {
     */
 
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    address P, Prec;
+    P=allocate(x);
+    if (first(L)==NULL){
+        insertFirst(L, P);
+    } else{
+        Prec=first(L);
+        while (next(Prec) != NULL && x > info(Prec)){
+            Prec=next(Prec);
+        }
+        if (x!=info(Prec)){
+            if(x>info(Prec)){
+                insertLast(L, P);
+            } else if(x<info(Prec)){
+                insertFirst(L, P);
+            } else{
+                insertAfter(L, Prec, P);
+            }
+        }
+    }
     //----------------------------------------
 }