From 1633281630e060b062ed32cdbe2237054f90b18e Mon Sep 17 00:00:00 2001
From: Mehdi ALAOUI <alaoui.mehdi.1995@gmail.com>
Date: Wed, 5 Apr 2017 01:23:33 +0100
Subject: [PATCH 1/4] Modified variance.c: renamed file (lowercase), better
 filling method (with realloc), optimized sorting and more readable code

---
 VARIANCE.C | 56 ------------------------------------------------------
 variance.c | 54 ++++++++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 54 insertions(+), 56 deletions(-)
 delete mode 100644 VARIANCE.C
 create mode 100644 variance.c

diff --git a/VARIANCE.C b/VARIANCE.C
deleted file mode 100644
index 627d71e1..00000000
--- a/VARIANCE.C
+++ /dev/null
@@ -1,56 +0,0 @@
-#include<stdio.h>
-#include<conio.h>
-#include<math.h>
-void main()
-{
-	int a[10],n,i,j,temp,sum=0;
-	float mean,var,stand;
-	clrscr();
-	printf("Enter no. for Random Numbers :");
-	scanf("%d",&n);
-	for(i=0;i<n;i++)
-	{
-		a[i]=rand()%100;
-	}
-	printf("Random Numbers Generated are :\n");
-	for(i=0;i<n;i++)
-	{
-		printf("\n%d",a[i]);
-	}
-	printf("\n");
-	printf("\nSorted Data:");
-	for(i=0;i<n;i++)
-	{
-		for(j=0;j<n;j++)
-		{
-			if(a[i]<a[j])
-			{
-				temp=a[i];
-				a[i]=a[j];
-				a[j]=temp;
-			}
-		}
-	}
-	for(i=0;i<n;i++)
-	{
-		printf("\n%d",a[i]);
-		sum=sum+a[i];
-	}
-	mean=sum/(float)n;
-	printf("\nMean :");
-	printf("%f",mean);
-	printf("\n");
-	for(i=0;i<n;i++)
-	{
-		sum=sum+(pow((a[i]-mean),2));
-	}
-	var=sum/(float)n;
-	printf("\nVariance is : %f",var);
-	printf("\n");
-	stand=sqrt(var);
-	printf("\nStandard Deviation is : %f",stand);
-	getch();
-}
-
-
-
diff --git a/variance.c b/variance.c
new file mode 100644
index 00000000..86e42ccf
--- /dev/null
+++ b/variance.c
@@ -0,0 +1,54 @@
+#include<stdio.h>
+#include <stdlib.h>
+#include<math.h>
+
+int main() {
+
+	int *ARRAY=NULL,ARRAY_LENGTH,i,TEMPORARY_ELEMENT,isSorted=0;
+	float MEAN=0,VARIANCE=0,STAND;
+
+
+	printf("Enter no. for Random Numbers :");
+	scanf("%d",&ARRAY_LENGTH);
+    ARRAY=(int *)realloc(ARRAY,ARRAY_LENGTH*(sizeof(int))); //We allocate the dedicated memory
+	for(i=0;i<ARRAY_LENGTH;i++) //We generate the random numbers
+		ARRAY[i]=rand()%100;
+
+	printf("Random Numbers Generated are :\n"); //We display them
+	for(i=0;i<ARRAY_LENGTH;i++)
+		printf("%d ",ARRAY[i]);
+
+	printf("\nSorted Data: ");//Then we sort it using Bubble Sort..
+
+    while(!isSorted){ //While our array's not sorted
+        isSorted=1; //we suppose that it's sorted
+        for(i=0;i<ARRAY_LENGTH-1;i++){ //then for each element of the array
+            if(ARRAY[i]>ARRAY[i+1]){  // if the two elements aren't sorted
+                isSorted=0;    //it means that the array is not sorted
+                TEMPORARY_ELEMENT=ARRAY[i]; //and we switch these elements using TEMPORARY_ELEMENT
+                ARRAY[i]=ARRAY[i+1];
+                ARRAY[i+1]=TEMPORARY_ELEMENT;
+            }
+        }
+    }
+	for(i=0;i<ARRAY_LENGTH;i++) {
+		printf("%d ",ARRAY[i]);
+		MEAN=MEAN+ARRAY[i];
+	}
+	MEAN=MEAN/(float)ARRAY_LENGTH;
+
+	for(i=0;i<ARRAY_LENGTH;i++)
+		VARIANCE=VARIANCE+(pow((ARRAY[i]-MEAN),2));
+
+	VARIANCE=VARIANCE/(float)ARRAY_LENGTH;
+    STAND=sqrt(VARIANCE);
+
+
+    printf("\n\n- Mean is: %f\n",MEAN);
+	printf("- Variance is: %f\n",VARIANCE);
+	printf("- Standard Deviation is: %f\n",STAND);
+
+}
+
+
+

From fb4ce2069952a8031306d4a1b430c1cad0f78dd6 Mon Sep 17 00:00:00 2001
From: Mehdi ALAOUI <alaoui.mehdi.1995@gmail.com>
Date: Fri, 7 Apr 2017 04:29:56 +0100
Subject: [PATCH 2/4] Adding an algorithm that returns the longest increasing
 subsequence from an array

---
 LongestSubSequence.c | 115 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 115 insertions(+)
 create mode 100644 LongestSubSequence.c

diff --git a/LongestSubSequence.c b/LongestSubSequence.c
new file mode 100644
index 00000000..bf2e7e54
--- /dev/null
+++ b/LongestSubSequence.c
@@ -0,0 +1,115 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int* longestSubsequence(int* ARRAY, int LENGTH, int**RESULT,int* leRESULT_LENGTH){
+	if(LENGTH<=1){
+		*RESULT=ARRAY;
+		*leRESULT_LENGTH=LENGTH;
+	
+	}
+	else{
+		int PIVOT=ARRAY[0],n;
+		int* LongestSub=NULL;
+		longestSubsequence(ARRAY+1,LENGTH-1,&LongestSub,&n);
+		if (PIVOT<=LongestSub[0]){
+			int *newArray=(int *)realloc(NULL,(n+1)*sizeof(int));
+			int i;
+			newArray[0]=PIVOT;
+			for(i=1;i<n+1;i++)
+				newArray[i]=LongestSub[i-1];
+			*RESULT = newArray;
+			*leRESULT_LENGTH = n+1;
+
+		}
+		else{
+
+			*RESULT=LongestSub;
+			*leRESULT_LENGTH=n;
+		}
+	}
+}
+
+void longestSub(int* ARRAY,int ARRAY_LENGTH, int** RESULT,int* RESULT_LENGTH){	//RESULT and RESULT_LENGTH will be modified by their pointers
+	
+	if(ARRAY_LENGTH<=1){
+		*RESULT=ARRAY;
+		*RESULT_LENGTH=ARRAY_LENGTH;
+	}
+	else{
+		int PIVOT=ARRAY[0];													
+		int *maxi=NULL;														
+		int maxi_length=0,i,j;												
+		int TEMPORARY_ARRAY_LENGTH=0, *TEMPORARY_ARRAY=NULL;
+		int *LS_RESULT=NULL, LS_RESULT_length;
+
+		for(i=1;i<ARRAY_LENGTH;i++){
+			if (ARRAY[i]<PIVOT){
+				
+				TEMPORARY_ARRAY_LENGTH=0;
+				TEMPORARY_ARRAY=NULL;
+
+				for(j=i+1;j<ARRAY_LENGTH;j++){
+					if(ARRAY[j]>=ARRAY[i]){
+
+						TEMPORARY_ARRAY_LENGTH++;
+						TEMPORARY_ARRAY=(int *)realloc(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH*sizeof(int));
+						TEMPORARY_ARRAY[TEMPORARY_ARRAY_LENGTH-1]=ARRAY[j];
+					}
+				}
+
+				LS_RESULT=NULL;
+				LS_RESULT_length=0;
+				longestSub(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH,&LS_RESULT,&LS_RESULT_length);
+				if(maxi_length<LS_RESULT_length+1){
+
+					maxi_length=LS_RESULT_length+1;
+					maxi=(int*)realloc(maxi,(maxi_length)*sizeof(int));
+					maxi[0]=ARRAY[i];
+
+					for(i=1;i<maxi_length;i++)
+						maxi[i]=LS_RESULT[i-1];	
+				}
+			}
+		}
+
+		TEMPORARY_ARRAY=NULL;
+		TEMPORARY_ARRAY_LENGTH=0;
+		for(i=1;i<ARRAY_LENGTH;i++){
+
+			if(ARRAY[i]>=PIVOT){
+				TEMPORARY_ARRAY_LENGTH++;
+				TEMPORARY_ARRAY=(int *)realloc(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH*sizeof(int));
+				TEMPORARY_ARRAY[TEMPORARY_ARRAY_LENGTH-1]=ARRAY[i];
+			}
+		}
+
+		longestSub(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH,&LS_RESULT,&LS_RESULT_length);
+		if(LS_RESULT_length+1>maxi_length){
+			
+			maxi_length=LS_RESULT_length+1;
+			maxi=(int*)realloc(maxi,(maxi_length)*sizeof(int));
+			maxi[0]=PIVOT;
+			for(i=1;i<maxi_length;i++)
+				maxi[i]=LS_RESULT[i-1];
+		}
+		*RESULT=maxi;
+		*RESULT_LENGTH=maxi_length;
+	}
+	
+
+}
+
+int main(){
+
+	int *example=NULL;
+	int n,i;
+	int t[9]={10, 22, 9, 33, 21, 50, 41, 60, 80};
+	//Il y'a un problème au cas où on a un maximum au milieu
+	longestSub(t,9,&example,&n);
+	printf("longueur: %d\n",n);
+	for(i=0;i<n;i++)
+		printf("%d ",example[i]);
+	printf("\n");
+
+	return 0;
+}
\ No newline at end of file

From b893041e478fe546612056f6a31f29bf7634f50b Mon Sep 17 00:00:00 2001
From: Mehdi ALAOUI <alaoui.mehdi.1995@gmail.com>
Date: Fri, 7 Apr 2017 04:37:52 +0100
Subject: [PATCH 3/4] Optimizing code and renaming variables

---
 LongestSubSequence.c | 75 ++++++++++++++------------------------------
 1 file changed, 23 insertions(+), 52 deletions(-)

diff --git a/LongestSubSequence.c b/LongestSubSequence.c
index bf2e7e54..6f5cf8e8 100644
--- a/LongestSubSequence.c
+++ b/LongestSubSequence.c
@@ -1,33 +1,6 @@
 #include <stdio.h>
 #include <stdlib.h>
 
-int* longestSubsequence(int* ARRAY, int LENGTH, int**RESULT,int* leRESULT_LENGTH){
-	if(LENGTH<=1){
-		*RESULT=ARRAY;
-		*leRESULT_LENGTH=LENGTH;
-	
-	}
-	else{
-		int PIVOT=ARRAY[0],n;
-		int* LongestSub=NULL;
-		longestSubsequence(ARRAY+1,LENGTH-1,&LongestSub,&n);
-		if (PIVOT<=LongestSub[0]){
-			int *newArray=(int *)realloc(NULL,(n+1)*sizeof(int));
-			int i;
-			newArray[0]=PIVOT;
-			for(i=1;i<n+1;i++)
-				newArray[i]=LongestSub[i-1];
-			*RESULT = newArray;
-			*leRESULT_LENGTH = n+1;
-
-		}
-		else{
-
-			*RESULT=LongestSub;
-			*leRESULT_LENGTH=n;
-		}
-	}
-}
 
 void longestSub(int* ARRAY,int ARRAY_LENGTH, int** RESULT,int* RESULT_LENGTH){	//RESULT and RESULT_LENGTH will be modified by their pointers
 	
@@ -37,10 +10,9 @@ void longestSub(int* ARRAY,int ARRAY_LENGTH, int** RESULT,int* RESULT_LENGTH){	/
 	}
 	else{
 		int PIVOT=ARRAY[0];													
-		int *maxi=NULL;														
-		int maxi_length=0,i,j;												
+		int *LONGEST_SUB=NULL;														
+		int LONGEST_SUB_LENGTH=0,i,j;												
 		int TEMPORARY_ARRAY_LENGTH=0, *TEMPORARY_ARRAY=NULL;
-		int *LS_RESULT=NULL, LS_RESULT_length;
 
 		for(i=1;i<ARRAY_LENGTH;i++){
 			if (ARRAY[i]<PIVOT){
@@ -57,17 +29,15 @@ void longestSub(int* ARRAY,int ARRAY_LENGTH, int** RESULT,int* RESULT_LENGTH){	/
 					}
 				}
 
-				LS_RESULT=NULL;
-				LS_RESULT_length=0;
-				longestSub(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH,&LS_RESULT,&LS_RESULT_length);
-				if(maxi_length<LS_RESULT_length+1){
+				longestSub(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH,&TEMPORARY_ARRAY,&TEMPORARY_ARRAY_LENGTH);
+				if(LONGEST_SUB_LENGTH<TEMPORARY_ARRAY_LENGTH+1){
 
-					maxi_length=LS_RESULT_length+1;
-					maxi=(int*)realloc(maxi,(maxi_length)*sizeof(int));
-					maxi[0]=ARRAY[i];
+					LONGEST_SUB_LENGTH=TEMPORARY_ARRAY_LENGTH+1;
+					LONGEST_SUB=(int*)realloc(LONGEST_SUB,(LONGEST_SUB_LENGTH)*sizeof(int));
+					LONGEST_SUB[0]=ARRAY[i];
 
-					for(i=1;i<maxi_length;i++)
-						maxi[i]=LS_RESULT[i-1];	
+					for(i=1;i<LONGEST_SUB_LENGTH;i++)
+						LONGEST_SUB[i]=TEMPORARY_ARRAY[i-1];	
 				}
 			}
 		}
@@ -83,17 +53,17 @@ void longestSub(int* ARRAY,int ARRAY_LENGTH, int** RESULT,int* RESULT_LENGTH){	/
 			}
 		}
 
-		longestSub(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH,&LS_RESULT,&LS_RESULT_length);
-		if(LS_RESULT_length+1>maxi_length){
-			
-			maxi_length=LS_RESULT_length+1;
-			maxi=(int*)realloc(maxi,(maxi_length)*sizeof(int));
-			maxi[0]=PIVOT;
-			for(i=1;i<maxi_length;i++)
-				maxi[i]=LS_RESULT[i-1];
+		longestSub(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH,&TEMPORARY_ARRAY,&TEMPORARY_ARRAY_LENGTH);
+		if(TEMPORARY_ARRAY_LENGTH+1>LONGEST_SUB_LENGTH){
+
+			LONGEST_SUB_LENGTH=TEMPORARY_ARRAY_LENGTH+1;
+			LONGEST_SUB=(int*)realloc(LONGEST_SUB,(LONGEST_SUB_LENGTH)*sizeof(int));
+			LONGEST_SUB[0]=PIVOT;
+			for(i=1;i<LONGEST_SUB_LENGTH;i++)
+				LONGEST_SUB[i]=TEMPORARY_ARRAY[i-1];
 		}
-		*RESULT=maxi;
-		*RESULT_LENGTH=maxi_length;
+		*RESULT=LONGEST_SUB;
+		*RESULT_LENGTH=LONGEST_SUB_LENGTH;
 	}
 	
 
@@ -103,9 +73,10 @@ int main(){
 
 	int *example=NULL;
 	int n,i;
-	int t[9]={10, 22, 9, 33, 21, 50, 41, 60, 80};
-	//Il y'a un problème au cas où on a un maximum au milieu
-	longestSub(t,9,&example,&n);
+	//int t[9]={10, 22, 9, 33, 21, 50, 41, 60, 80};
+	int t[8]={18, 2, 15, 4, 30, 0, 11, 12};
+	//Il y'a un problème au cas où on a un LONGEST_SUBmum au milieu
+	longestSub(t,8,&example,&n);
 	printf("longueur: %d\n",n);
 	for(i=0;i<n;i++)
 		printf("%d ",example[i]);

From a70400eead235c8d9143c5c2ec8e2325c6eade59 Mon Sep 17 00:00:00 2001
From: Mehdi ALAOUI <alaoui.mehdi.1995@gmail.com>
Date: Fri, 7 Apr 2017 04:50:50 +0100
Subject: [PATCH 4/4] Main reviewed, space added between operators (+,..)

---
 LongestSubSequence.c |  92 ++++++++++++++++++++++---------------------
 a.out                | Bin 8649 -> 8816 bytes
 2 files changed, 47 insertions(+), 45 deletions(-)

diff --git a/LongestSubSequence.c b/LongestSubSequence.c
index 6f5cf8e8..b1d74a41 100644
--- a/LongestSubSequence.c
+++ b/LongestSubSequence.c
@@ -4,66 +4,66 @@
 
 void longestSub(int* ARRAY,int ARRAY_LENGTH, int** RESULT,int* RESULT_LENGTH){	//RESULT and RESULT_LENGTH will be modified by their pointers
 	
-	if(ARRAY_LENGTH<=1){
+	if(ARRAY_LENGTH <= 1){
 		*RESULT=ARRAY;
-		*RESULT_LENGTH=ARRAY_LENGTH;
+		*RESULT_LENGTH = ARRAY_LENGTH;
 	}
 	else{
-		int PIVOT=ARRAY[0];													
-		int *LONGEST_SUB=NULL;														
-		int LONGEST_SUB_LENGTH=0,i,j;												
-		int TEMPORARY_ARRAY_LENGTH=0, *TEMPORARY_ARRAY=NULL;
+		int PIVOT = ARRAY[0];													
+		int *LONGEST_SUB = NULL;														
+		int i, j, LONGEST_SUB_LENGTH = 0;												
+		int TEMPORARY_ARRAY_LENGTH = 0, *TEMPORARY_ARRAY = NULL;
 
-		for(i=1;i<ARRAY_LENGTH;i++){
-			if (ARRAY[i]<PIVOT){
+		for(i = 1; i < ARRAY_LENGTH; i++){
+			if (ARRAY[i] < PIVOT){
 				
-				TEMPORARY_ARRAY_LENGTH=0;
-				TEMPORARY_ARRAY=NULL;
+				TEMPORARY_ARRAY_LENGTH = 0;
+				TEMPORARY_ARRAY = NULL;
 
-				for(j=i+1;j<ARRAY_LENGTH;j++){
-					if(ARRAY[j]>=ARRAY[i]){
+				for(j = i+1;j < ARRAY_LENGTH; j++){
+					if(ARRAY[j] >= ARRAY[i]){
 
 						TEMPORARY_ARRAY_LENGTH++;
-						TEMPORARY_ARRAY=(int *)realloc(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH*sizeof(int));
-						TEMPORARY_ARRAY[TEMPORARY_ARRAY_LENGTH-1]=ARRAY[j];
+						TEMPORARY_ARRAY = (int *)realloc(TEMPORARY_ARRAY, TEMPORARY_ARRAY_LENGTH*sizeof(int));
+						TEMPORARY_ARRAY[TEMPORARY_ARRAY_LENGTH-1] = ARRAY[j];
 					}
 				}
 
-				longestSub(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH,&TEMPORARY_ARRAY,&TEMPORARY_ARRAY_LENGTH);
-				if(LONGEST_SUB_LENGTH<TEMPORARY_ARRAY_LENGTH+1){
+				longestSub(TEMPORARY_ARRAY, TEMPORARY_ARRAY_LENGTH, &TEMPORARY_ARRAY, &TEMPORARY_ARRAY_LENGTH);
+				if(LONGEST_SUB_LENGTH < TEMPORARY_ARRAY_LENGTH + 1){
 
-					LONGEST_SUB_LENGTH=TEMPORARY_ARRAY_LENGTH+1;
-					LONGEST_SUB=(int*)realloc(LONGEST_SUB,(LONGEST_SUB_LENGTH)*sizeof(int));
-					LONGEST_SUB[0]=ARRAY[i];
+					LONGEST_SUB_LENGTH = TEMPORARY_ARRAY_LENGTH + 1;
+					LONGEST_SUB = (int *)realloc(LONGEST_SUB, LONGEST_SUB_LENGTH*sizeof(int));
+					LONGEST_SUB[0] = ARRAY[i];
 
-					for(i=1;i<LONGEST_SUB_LENGTH;i++)
-						LONGEST_SUB[i]=TEMPORARY_ARRAY[i-1];	
+					for(i = 1;i < LONGEST_SUB_LENGTH; i++)
+						LONGEST_SUB[i] = TEMPORARY_ARRAY[i-1];	
 				}
 			}
 		}
 
-		TEMPORARY_ARRAY=NULL;
-		TEMPORARY_ARRAY_LENGTH=0;
-		for(i=1;i<ARRAY_LENGTH;i++){
+		TEMPORARY_ARRAY = NULL;
+		TEMPORARY_ARRAY_LENGTH = 0;
+		for(i = 1;i < ARRAY_LENGTH; i++){
 
-			if(ARRAY[i]>=PIVOT){
+			if(ARRAY[i] >= PIVOT){
 				TEMPORARY_ARRAY_LENGTH++;
-				TEMPORARY_ARRAY=(int *)realloc(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH*sizeof(int));
-				TEMPORARY_ARRAY[TEMPORARY_ARRAY_LENGTH-1]=ARRAY[i];
+				TEMPORARY_ARRAY = (int *)realloc(TEMPORARY_ARRAY, TEMPORARY_ARRAY_LENGTH*sizeof(int));
+				TEMPORARY_ARRAY[TEMPORARY_ARRAY_LENGTH-1] = ARRAY[i];
 			}
 		}
 
-		longestSub(TEMPORARY_ARRAY,TEMPORARY_ARRAY_LENGTH,&TEMPORARY_ARRAY,&TEMPORARY_ARRAY_LENGTH);
-		if(TEMPORARY_ARRAY_LENGTH+1>LONGEST_SUB_LENGTH){
+		longestSub(TEMPORARY_ARRAY, TEMPORARY_ARRAY_LENGTH, &TEMPORARY_ARRAY, &TEMPORARY_ARRAY_LENGTH);
+		if(TEMPORARY_ARRAY_LENGTH + 1 > LONGEST_SUB_LENGTH){
 
-			LONGEST_SUB_LENGTH=TEMPORARY_ARRAY_LENGTH+1;
-			LONGEST_SUB=(int*)realloc(LONGEST_SUB,(LONGEST_SUB_LENGTH)*sizeof(int));
-			LONGEST_SUB[0]=PIVOT;
-			for(i=1;i<LONGEST_SUB_LENGTH;i++)
-				LONGEST_SUB[i]=TEMPORARY_ARRAY[i-1];
+			LONGEST_SUB_LENGTH = TEMPORARY_ARRAY_LENGTH + 1;
+			LONGEST_SUB = (int *)realloc(LONGEST_SUB, LONGEST_SUB_LENGTH*sizeof(int));
+			LONGEST_SUB[0] = PIVOT;
+			for(i = 1;i < LONGEST_SUB_LENGTH; i++)
+				LONGEST_SUB[i] = TEMPORARY_ARRAY[i-1];
 		}
-		*RESULT=LONGEST_SUB;
-		*RESULT_LENGTH=LONGEST_SUB_LENGTH;
+		*RESULT = LONGEST_SUB;
+		*RESULT_LENGTH = LONGEST_SUB_LENGTH;
 	}
 	
 
@@ -71,15 +71,17 @@ void longestSub(int* ARRAY,int ARRAY_LENGTH, int** RESULT,int* RESULT_LENGTH){	/
 
 int main(){
 
-	int *example=NULL;
-	int n,i;
-	//int t[9]={10, 22, 9, 33, 21, 50, 41, 60, 80};
-	int t[8]={18, 2, 15, 4, 30, 0, 11, 12};
-	//Il y'a un problème au cas où on a un LONGEST_SUBmum au milieu
-	longestSub(t,8,&example,&n);
-	printf("longueur: %d\n",n);
-	for(i=0;i<n;i++)
-		printf("%d ",example[i]);
+	int EXAMPLE_LENGTH = 8;
+	int EXAMPLE[] = {18, 2, 15, 4, 30, 0, 11, 12};
+	
+	int *RESULT = NULL;
+	int RESULT_LENGTH, i;
+	
+	longestSub(EXAMPLE, EXAMPLE_LENGTH, &RESULT, &RESULT_LENGTH);
+
+	printf("Longest Sub Sequence length: %d and it's:\n", RESULT_LENGTH);
+	for(i = 0;i < RESULT_LENGTH; i++)
+		printf("%d ",RESULT[i]);
 	printf("\n");
 
 	return 0;
diff --git a/a.out b/a.out
index 2e15b7b8b348a83c5949f78c7c578b9aeae5f37a..2e5e0141d89919a60553275cd7927cf0b1e8d0f3 100755
GIT binary patch
literal 8816
zcmeHMZ){uD6~DHVHvNO+mH_?3RtwrKREtSU8q$^xJIQNbP||j7To^38IJT1*61&*X
zEJfwdWMFtEU8n6s_F)>*n8rR#>h@uaCbp)uA}vBwKm~PLKLixOp}>L|UG|4&zjNO`
zj{V|H)wD_buxq_{?)lww&OP_ubML$N`f;sex6|PeoSfn-g1Guhzl5x}5GOWBR$<Lz
zh470_;zqFyNF^S>EFo&;n9eEFOskZf3$y}Hv(o~aoqm~NdZPuS1}m|LM5(@o<X2gX
z9$js*Ooi}Dfb_^$k6W^!Ju<`8ul&#zWj$g^uU6^RDm|u?$}y(gK5831UCLgU(+`e#
zKM~O;-wTvvDeZs9j8MLIm1IHvGQ;!^3l>aS@2k)wKd&}<l;8nX-%|ZDtJ=p@vEtUj
zSZ`C~t%H%e!B{*!TsPd@RM*t#OC@~UWV^{e$?n-3lr?cbdcl#;HFzinsQk0^Z^w>m
zPt>{Jt^MxZ&tLxB^S@egl63h&_No)b%i1#1)Scz<FD-%Jwgj#L_u{dq%>c^T7wD%j
zbxV^ljFcG)KWKyp9yIzwu|aV-ZH5OzNs)|(1_u*iaX1-^n|+WY9THBO#!x602hu;3
zh%3Ypdpg=%T8(YK#zJnJZ#(LDqDP(hQO+SB#Jh5|CKkJfdb|rfVd)LA6(o1RDxa(F
zkvX2v3Kr`;7QP$+jRz-h5w1d97S$HvG`^hbi*SxvDr+vni{n?%d{Cw5Dub)MLVs%9
ztjwn%tY^+too0&`o!{O9k@+occvo-oBS-uI70yh}BW>A9Jh?tIDfw;0lgl&XlHW=^
zxjJ(~@;4DrF3vnB`PWx^Mc;AoGBteIo_+0pJ^QwvnV#L>)jlykwbC#2iBpFqnaHg0
zi~LWa_~*XrO>IJq-HiqY^}78adS=e8XWw~v;~1HuX07QyNd@y$5PnkH?><ef=<_lE
zJ1P(A-~31#ICaGZ1A2B=Kb5~zcf72>cE!A|U~Ls!tKKBKPh0gr@#Pr&7wI)YDCXmE
zto!B4Lx3Eg$eK=iv7qUhJ4L$k()XZOF!nJi%ujaDJOUlcV?_4r*+<W2(`WQ-a7@p3
zo`~qViY>L&maI0{FrInzjN|e3dQKbDbHTHE)`RScT<}cRGvh!9gFBlOS#4UM&}ONz
z6WWwT&JzKex7Z7Ev@&?-v<v#EK2r0P6o9_&n9PY?+I00u4~i$W5=}^F#vNJh;>@=p
zpVKZb*7YchtBWkcsU0sJJ(SbVOYQT>lqlx)?3;RaBLCKB^YdtE9_`5Ig6H+{>-wp;
zoqFc|3f=LNs?BCM>&$2u9VpwSovD8I0rX@peV+97k<Rn_ND!tc@;|x)SXRDEo2owc
zE$O@E%T!LAD)D7j`4Y5znJwEv)bF!d&x9sB@=}9cXcqp;Ms!}#!{_u<Z=n%0XatQ8
z9KHaDFTj<f6NNmSe+XVK43X@2t{`o%pfF5V(W|+C{L5aI<6ov%m6K<VX3F$vCwiyQ
zqmP+9vP<^na?6KV>bG2Q`ajWiFh#Qf<E3W7RMvAG;9Nw%&6+b<(~Q5*&!0QZlgl=n
zCbTnE2!#o4lD;blby~B~<<*j0q!kJi=<||H;|(sqN|Fy~4}`HgODH1kMMT=!9H#Av
zHc0{JLvwT5i`kb?&aL!YGd@54xB2-AZJabN)xyuSx!^cQIL$c--;Aw@TpsejhHyq3
zN1VL4LmNLjd2%Jx^4|n%Eg!i~YUXOWG@zNoC^)CqqrlyPLxJpkAQ<TC7};{n<;CJQ
zQb+V)d-igB_Kl8PXr-yrPkrXf|K+cUji){|y$yfl^{^xRen<9l8!XJ%T+}nC9r}(-
z>G$cwa9?-e>w)gT{Q=|j@rCvC6MQeEJ@x6J?;@p+M7%$mGQ9`Wz21Y-htkn_IO-jY
z#{12Io!%`GZzvw|#>_9KcCHlQ@a@~^+C_UV`bLeyt!F^1(5`zxuYjHay$@4l5>&@L
zrv+{dw3*g2q#BC|$0G-XW7y-^xO#cjamR8G;k0LY0XDZP86xH7h1iTTlCOe%52$c^
zcDvWzRlVvPRZoaJH|*Ma+vb}HCYd%oyWv|mecb|X&(qG<YnHk0aiMBi9s!)eRCy1y
zQ0{!2ily$8fcK+KQ7Uh7d%ojraj!e((%jyWiWYb6vz5BL{^@19yE(JG)9p{Xn*;9p
zfV;NE?S&lVTijK$9j`)t7<R0lCu9Fl|Fb=?%r9M=Qs+PRQ-yJ14@gT4rO^t%q}W`_
zG>sL7(t7!(^Hz_{ZB#r$OC~-}u2ba{uavm_(<}1{;zyl+B84+wkIUkDuQ=wkcv^ud
zJzx<*D<P$I77^De%7mtbOxRvg;@BLP+`{~$eJ`aOEF!$By^L2Wp8e+fu(_6rd4#`g
z&jsZ_mIldlzs@TD6;-a(|LcU$vG$7IRPB0K(aVZ1Q*m*<Ek0O(PiyN=Z*8zQ9XHe7
z?Y>4|eO*&pat)6)H2LZqeT}zRxOZE9LsNZI{SH=LlDZIe%})QKayspFmBn4cEQ?nZ
z;;Gn}3(+-JR(_e_cq^4(F3OFQ3(?EtTPnXoaGaFlD+}>dimxint5STm7+2#^ieDqV
zWyZrL+=Y9bQu%7Z^RyKAh*>p%OYt>@dx%netr$@E6Q%gIg?V3!*9e~PrTBG%jv@Bs
z64&G2r5t{P;PYy+j*Diyn$M;9df_jNZxD2>vL~0|)oP)H=4placzyw~a<mRQu)5g&
zr}fW?{_nAk3t1-oIUDX%xP9HFZ@5D&_{r<VL5VN!&qtIUq1JJ*GChsALo6Pbp8zk{
zuBF=h8);{)7+&p1ZXumTwp>4uL^=ECrRued;^7@>XYsgyq~!T~B3Y7^9kMt+Yk)h-
z#KTtLYtjF7YNy2O{!WQYsN}Uz$$vrhr`$_H;$Gn15=o2sy~G#C+rz*;_$u1ttr7TI
zv3Nc{D)Ge?{9p<E=S$$P0;hWI@&5<l<^0bBU*lXablbf6lyF$$^`Sz!R)G$r{-o;<
zN^-9VI)%rBxV^__=XKa2dA?ufJ#US)10`F!1vuHU_uF<=FWt9LdQZNE*a_UL^2KB?
zaB7#`&b>>>yQTdy>u@+}rp$C-pD&DSxw~2q7#-~gy9`4_qRD7~EM-QMhB;(}2NUsV
z3KEfo(Lb2z4GkI*Gm%Ugq4cl_Cx#9WM$Kr%cl-9{?d64xzF0hFgp$e75hEHmlSf2f
zGBgx5BI%)_BTy;g3`m+KqUvyivkf0@q_?{d1UfZC+uH_rE#Em`Vj&`owy*6Cbhfub
zs;ER>NCLu@t)c0LWle88AdEd7`&t4W#=hOV4{BXTSD>XsqZ;HjW;m6WZQ<Kazn`x!
z>CzJ2M8`0ADvb87PGg}LyE<E`54%FWgHd5bBOx;clchJP3$_~7<>>-K))(ER+Kb7m
zb*&27k~>z6Tq<D<;222Nx9@{gBo;T)sVKT<p=H!Pe1B^<-kVA(+twxST@M=vREV?=
zhEgdRA800z2(_PMsHFA6mpU?JhI&EGq(uifha2N)^04s56K2#GXlbuAL;Z^DkEeaT
z=@_o)V-evaZXlEz5WdKfIP6)}Oj;!mN0X^oB3{B6C`(2ML!_W`hX+mJlWq1P>+4T|
zHKW6LQ@BDXA;-xV9Z&%}5P=cqELAH~Ee*~;5QZ442@S=<@F8K6c_1|CKJ=sTVa^O;
z9u!aMe=ASlUo1g|b)WZ@{67?*L)bXU7N?uREXRZ8K_=dR^8Y+ug)`xGlKBQ?iuHM)
zYAS=9Sx`~CejD)1I4f}dqfWn+9901OUn$Xr^OR!6US#NO#QMDN9aF#yN^lt{wY^I5
z*jdSR2yZ$&v3`%sFYz9ApyKnF1o5)>AN}7zXCKz*ee^3z->nqcf0kqVAj;`1#XRq~
zFDU(brEm9N!GiWj)TgY^`|>K)(cDh1-`@Twm41sd$mc<?(jQhh>60zH{xM+GC*&U`
zK0l8teLfdkrIxRpCz{1mtk36xai!lwLPg1=@=U)EzF6N|>6a2-)nN8lsTKTZ{)fmE
z>+^TKUg`gmJ5DKZy{!LZn?9dIrquzS&&@2an#HX6nbPO+<Ne62(!aeRX=Uu~`GrlN
z|5xSzTko*x+v`7R)93TgfVyy?eP?m9*MAO$6yqvf3+E*M|J5#U=ih)X-2k&bpQqNT
ziDQ?y^KU_yTx5Mdw|K8o|6S-(?6N+e&-njw{vVv<o9pK|7`4^U=eRj)6cWo@+yc+|
zpHNWjf8o5RD)6(SqO8Ys&Zf`%V!zU7KiLfHF@FUa!npmspWLq$?eey85H0|O)w4lG
zS-;VSvp&-`DCfG1MW0s}ZmU^P71~%?H_x47{b!W_FQ|c|{}pb<!|kE9j1tYya`o4%
O3o`zWNnyO~_5Tw=;VUly

literal 8649
zcmeHMeQaA-6~DIg)i1{_Var<9JXkBG6Y-KXZJo7a&q-eUQYCHII%`o$UmSlVX0aXF
z&s{obS1D^X6EY@*piF?ugkXPw*1twH37Ra`k_nJ9BoKmvqKcv<?L@1F5>466IrrUT
zzxU!uMTq};Ex&Wm?|j^I&$}P*zW1`yvES)%Fe*;=C5GIU5}8BBm9fhkIV&(9Tf=0w
zm2F{VfRw^t<`Sevjp&kaO|(Mjxqz0y-{&*{pHt=)qMtKhMwB8%itQDOEUE^*CK@2h
zn8f91hp~FxoCVs$D?}*{S;Rwj$f8}Xu&WhzL}x@`M5%w+H~a^LzkpK)4tW^~Yvb1f
zMO`dMZt7vI>*bsUD)S1_eFn^klHGG)hjBh=@d(AEqP^Afa!2%!s9@Ps1F_!SO-~Jk
z>jq+p%uwBsZ+G49CT}|FZRGt%|EPQ5P#15B@>mTV##{w|90Mr-y6@^>x;ZiS&dL5%
z?w3FM-LKBB{W03oAF2;rHiPD-BHEu{1>Xs{R78K>D*6oi9l~zzW||gDCqvE6S~?U=
zMA={}me8YsqK1~%gDG8$2V)69`r^riKs0usqrIh7YxM5P*BZUMpfxA_jGSON4&bo=
zbe|rL#WtX{MPQlDu{CJZfyz*pDtkD^F@SlcQtj#CRUA&}kBVf%#SrD9S`%*eQ*Xj)
z%%Ooge7iy&DgDJdiK!RH_0qY$9K2RB$=$Kst~WuH+x`={R@TT+L%tt{^Rqc9+uuMQ
zLz|!B{I`+EkmkoZ{|)3Zl=&;bH+<Bd{qU5Uy`c{O{mzj<`_#AxW{5g9ak&i1R0PP}
z&p>f8T3OS^*w|qRyi2W9fvCevZZ&)JMQ8Wq82IA>FLqx=QEs-f<~(9!$dUfUk_+_J
z?0f3O!n3MlM*VOp1IF*7qI%)?`eL`5ec!OZA?(jTb9b%8SY~4vSk9e;K)T;A{To1z
zdz09Ib@-XLDnLQsnh&9>>#78+3h3u%y63+JCY3d8J`EIoK!WSDXRnVa*R#sflyV!}
zo>CSuVYlL<GSYed-M(lvnw|dl!o<hU?DWJ^&5rl7GZV8;$Bbiq$3%8It1M3`d=lSs
zk0^_kZ!34Q%Hl9UBg&n<%JR8|)tqD%XnfJ3+#WuAoxMCdqTJrAEM*=UQI??Z+aUS8
zBXduDn#<j)GSH{<=mtPPm=yi+Tn*#}i=X6j>Zr1e2~6ZsH>i&&%h{<p2Xy~~$>{6;
z<Nj>U|9pG)zQ3zI`v-rZV|4q8atUtHXdTjH9XoC|{6(Gk#DybqE{<+5e57x!ta$}9
z#X7PJ9ohSB;3HRcT^*iusLi)B3+nK-ij&>`ulT$Dr~KMvH0mY&doXVKm<A0T!Z;7N
zhox9r3QB1`l}z+WiA=mVk`iblsjrYI2|bdM^!|uYmGq<(>W_q802_?SvBkC52NdV(
z?d4n!Bi#pq2Y~K?4E!AEU7)`O`bEeC-t!*-ZGxMQ>n0Y*OGlYw$m7_uzP#dfN4W=a
z+$(3n-;<~yN^yP0wt*b=dqDpP>bgDq-PH#x*S%PAo;|yH?~^;XeF0(AX@h?T;+sam
z@Ah1Dwr(hMPD0Cu96R+m#M^9^>s-ujv41|0M^N74_I%5!xT{}tDQ;=BL~+-Cvs880
zUo2DIzTxstw>;qX`Q7z?cWsMXYH?SCev7+;_Z#!k1Affw6}o&_9%kTS1|DYMVFv#9
z3=Eda+{qC^$s;{G5?wC@a*3f252w6T!CsE#F@DAKRu8Xj5j>rb@HrhzwUFaJgN5Y(
z`ZSkB{*qHhl0Wm+y9^%pPAp?i83|j<uZ*1#6rbO*R2zhSR!|}?s=(tO7TQw`uCULF
zV;FmsYr+01+9!Nk@Dw+-2M_1G5D(jy(I24?+d1bQLhp{?Ulnoz|KACnW9<!{7Weg{
zpx+hrr-It`545&EE!B4QW)gZvYV!KLO?8bK&NZBCX!6!Kc^h^ZI9s9GSl7@jbPb(G
z#=Pk>aXr`zR8JYSpK5T-ilhda7aqMLUVlq_ogVBHTwfyN?ajpCR2mC2FLM3CbU*Wk
z&m_Q~LG_d&IUPx*W66Yt(Lk1p3<S|Y)CLE1=8Yv{aMdG2aE$^3vSc`@2bnk0uSHYA
zctq<DgDr7}g%(Vuf@cg1s(&>EYT!K>kA<M=BsheNm$zbg>`kYcH<XOWBMIG}<^P_?
zd52?+#<$NY16O$OLi3J;aG~)?{1Z^Yu}<~@rwm--y@tfO!lk58<+TR5n(cL`%yC^f
z+{U@W#ctmQqWds6sQpV$nJZrs0L5R*(Zc#6Sat|1xE7H8m{SH0*9}hCkU{vfIQHE>
zkDmt&*9x+y^`~AeASZ-95qthlfdJ<^+0*=fRoK(IMe&m!(HFoT*AC(@xn$ndC1GFB
zIpZv0j$gp+C8%Id$)47$X<=V26sdiC|6j4$)A~0n?0Zc1xF^`{Ujq!|DieCNU&!J{
z(>@@?JXWeB&BEVo-y_za9%0YVE+zwdUqbXdHhX%nc}3XwQeuP;vLlyo*z9S4s}dUk
zt@ETW+!D(!3wvrtDwnxT686t=u5hv2zXc-fKiSiJKzcv8uVBh+cKdg1_E$vvS48_&
z=-gE3{t+||6@2w6Zg+k^r}u?+eLIh5wn~#d?f2E<eX3pG&i@H)F+^$~-;`jH9?<@;
zpo?RV>}kKF_qj8o|1>_SeHsV<09$kW^qy@AI|YUG4X(fwehUO<dnTSY=*6Co3<V`S
zqKh_rpRo6d04Yv#Lw3Y}3>Czv|M+?fiz*E5`XU`%2QNAJBUX=$sgV6)6NXi?CyJj9
zsBN?A_o#hR6ha%z{n6Mr+e_jBQx!MvaS+zQpZY`V8qUvR?f2Ih-hwvg_Vx{};#U_$
z=X1&{gf5t^v`?CaE{KHoKPz66f6leyrTOPuD_+KEAF|@*jP@5RUcqSJu;ObN?FUwT
zZT>meimzj|ep~VNjMil<z9Ih|$%?xft)o`FlF|BT#Xb4&AXa=MqxH;+Z_2MzR{S&h
z^M)0#g7u`w4Dq@PP7SnPn1wF(NdA4h6^By-&2N*y1*Z_2w<Z`y!(%WHd(058yO@1f
zH0D(ayNlD&QgF|8z}qo<{5U<FYy+DukuCaOfqP1=xL@G*bKh~m9i}*GendIGGM}Tu
z&!El!_qqPc`!WW2v3_AY#qeqFXCoW0kfBy6e}rnWJfKD~KR3APrWNDi9{02IzAp=X
zI?r+zE|n0d15byx`?wwOO^|>5I)R0jnOy?^p~w&R2g_c-C0?^$j&pqF_~`}Q1LMj*
zeqw-cf*spFzmgoc`bKVe75q)%-#%{N23%U{hW#4wjm~N&+w$-m#Ni2m<~2Q^{26e}
z&*d_idy5F43xIoIydAOm`KQpQ=Qj%BzR<Vl!3haR|M)!!OEbU1Sp;xN)XiiI*Eb_Z
zeHY-^FS~#LDt=CKKSkEbP)bkh8Tir=f)9cRTaRiT?Z*O|#=?<Qq%W3+Bdw;#wa`E^
z5lOQmkfw!`THipjH#ne$^<*lo1v5ho&WVEq5j_(2?rz?*6Fe7D((uG;oIf=<Q>M-^
z<HQ=y#N%hc#KdWM(6y)@Gk^2ovF|_X?^HD9P#Xkq^n~gb<1o|OzI@2v+1?6TCJFyA
z%CrL=hg<v|+Ts2Ck0}8y;BV<r&>jDF8cJt)%nVNai9V*a2RgMvngX4zn500kcOb&>
z$ZULBWm<%vpAAdnW2`LG$5#Bry5h^MU2Jw{{bmb!O((VfU?L1{YVC)i$#5*8WzrGo
zW+7<oCd82dP;^s+)4Zq~-+~XG){ct%-8v9Vr{QK>zatld+5-~kETtN=K;y!a1D;*>
EAM?T9h5!Hn