diff --git a/Assignment8.txt b/Assignment8.txt
new file mode 100644
index 0000000..e0b11fe
--- /dev/null
+++ b/Assignment8.txt
@@ -0,0 +1,10 @@
+Clarke Littlejohn
+
+
+1) Can crash. The output if it was not going to crash would be something like ABC 123 or should ge.
+
+2) The total amount of bytes lot would be something like 1 or 2. the pointer p gets lost since new memory is allocated then.
+
+3) Line 26 causes memory leaks
+
+4)line 14 instead of {0,0}; make it {'0','0'}; line 25 free(p); line 32 free(p); 
diff --git a/sort.c b/sort.c
new file mode 100644
index 0000000..0a9003d
--- /dev/null
+++ b/sort.c
@@ -0,0 +1,89 @@
+//Clarke Littejohn
+//Sort
+#include<stdio.h>
+#include<time.h>
+#include<stdlib.h>
+int *asc(int[],int,int[]);
+int *dsc(int[],int,int[]);
+
+
+int main(){
+	srand(time(0));
+	int * array,size,*aAry,*dAry;
+	//user input
+	printf("Enter the size of the array: ");
+	scanf("%d",&size);
+	//creates arrays sizes
+	array=(int*) malloc(size*sizeof(int));
+	aAry = (int *) malloc(size*sizeof(int));
+	dAry = (int *) malloc(size*sizeof(int));
+	//gets values for the array
+	int i=0;
+	while(i<size){
+		array[i]=((rand()%25+1));
+		i++;
+	}
+	//calls the functions
+	aAry=asc(array,size,aAry);
+	dAry=dsc(array,size,dAry);
+	
+	printf("original array: ");
+	for(i=0;i<size;i++){
+		printf("%d\t",array[i]);
+	}
+	printf("\nascending array: ");
+	for(i=0;i<size;i++){
+		printf("%d\t",aAry[i]);
+	}
+	printf("\ndescending array: ");
+	for(i=0;i<size;i++){
+		printf("%d\t",dAry[i]);
+	}
+	printf("\n");
+	//clears the memory
+	free(aAry);
+	free(array);
+	free(dAry);
+}
+
+int *asc(int oAry[],int size,int sAry[]){
+	int i=0;
+	//copies the values into the array
+	for(;i<size;i++){
+		sAry[i]=oAry[i];
+	}
+	//sorts the array
+	for(i=0;i<size;i++){
+		int j = i;
+		for(;j<size;j++){
+				if(sAry[j]<sAry[i])
+				{	
+					int temp=sAry[j];
+					sAry[j]=sAry[i];
+					sAry[i]=temp;
+				}
+		}
+	}
+	return sAry;
+}
+
+int *dsc(int oAry[],int size,int sAry[]){
+	int i=0;
+	//copies the value into the array
+	for(;i<size;i++){
+		sAry[i]=oAry[i];
+	}
+	//sorts the array
+	for(i=0;i<size;i++){
+		int j = 0;
+		for(;j<size;j++){
+				if(sAry[j]<sAry[i])
+				{	
+					int temp=sAry[j];
+					sAry[j]=sAry[i];
+					sAry[i]=temp;
+				}
+		}
+	}
+	return sAry;
+}
diff --git a/stddev.c b/stddev.c
new file mode 100644
index 0000000..3dd228d
--- /dev/null
+++ b/stddev.c
@@ -0,0 +1,39 @@
+//Clarke Littlejohn
+//standard deviation calculator
+#include<stdio.h>
+#include<math.h>
+
+int main(){
+
+	FILE* p=fopen("test.txt","r");
+	int terms=0;
+	int tracker=0;
+	float j=0;
+	float xbar=0;
+	float sum=0;
+	float mean=0;
+	while(tracker<5){
+		fscanf(p,"%f",&j);
+		xbar+=j;
+		terms++;
+		tracker++;
+	}
+	xbar/=terms;	
+	tracker=0;
+	fclose(p);
+	p=fopen("test.txt","r");
+	while(tracker<5){
+		fscanf(p,"%f",&j);
+		j=j-xbar;
+		j=pow(j,2);
+		sum+=j;
+		tracker++;
+		
+	}
+	terms--;
+	sum/=terms;
+	sum = sqrt(sum);
+	printf("%f\n",sum);
+	fclose(p);	
+	return 0;
+}