Lloyd Page Assignment 8

assignment8.txt

@@ -0,0 +1,7 @@
+Lloyd Page
+1. CAN CRASH(potential for infinite while loop)
+char value at 129+130+131+"abc"
+2. 7
+3. 29(infinite while loop)
+4. 29: while((*q++==*b++)!=0) ;
+   32: free(p);

filestanddev.c

@@ -0,0 +1,45 @@
+/*Lloyd Page*/
+/*reads floats from float1.txt, calculates meand and stand dev of all read in values*/
+#include<stdio.h>
+#include<math.h>
+#include<stdlib.h>
+float avg(float[],int);
+float stddev(float[],float,int);
+int main()
+{
+	int x;
+	char handler[100];
+	FILE *f=fopen("float1.txt","r");
+	fgets(handler,sizeof(handler),f);
+	x=atoi(handler);
+	float num[x];
+	for(int i=0;i<x;i++)
+	{
+		float a;
+		fgets(handler,sizeof(handler),f);
+		a=atof(handler);
+		num[i]=a;
+	}
+	float a=avg(num,x);
+	printf("%g\n",a);
+	float stdev=stddev(num,a,x);
+	printf("%g\n",stdev);
+	return 0;
+}
+float avg(float num[],int size)
+{
+	float sum=0;
+	for(int i=0;i<size;i++)
+		sum+=num[i];
+	return sum/((float)size);
+}
+float stddev(float num[],float avg,int size)
+{
+	float sum=0;
+	for(int i=0;i<size;i++)
+	{
+		sum=sum+(num[i]-avg)*(num[i]-avg);
+	}
+	sum=sum/((float)(size-1));
+	return sqrt(sum);
+}

float1.txt

@@ -0,0 +1,11 @@
+10
+9
+11
+9
+11
+9
+11
+9
+11
+9
+11

sort.c

@@ -0,0 +1,97 @@
+/*Lloyd Page*/
+/*3 arrays allocated using malloc(), fill one with randum numbers, and sort one ascendingly, and the other descendingly, and print all three arrays*/
+/**/
+#include<stdio.h>
+#include<stdlib.h>
+#include<time.h>
+#include<string.h>
+void insertUp(int*,int);
+void insertDn(int*,int);
+int main()
+{
+	srand(time(NULL));
+	int size;
+	while(1)
+	{
+		int N=3;
+		char *line=malloc(N);
+		printf("Enter the size of the array\n");
+		fgets(line,N,stdin);
+		size_t last=strlen(line);
+		while(line[last-1]!='\n')
+		{
+			N*=2;
+			line=realloc(line,N);
+			fgets(line+last,N/2,stdin);
+			last=strlen(line);
+		}
+		if(sscanf(line,"%d",&size))
+			break;
+	}
+	int *a=(int*)malloc(size*4);
+	for(int i=0;i<size;i++)
+	{
+		*(a+i)=rand();
+	}
+	printf("Elements in Array a\n");
+	for(int i=0;i<size;i++)
+	{
+		printf("%d\n",*(a+i));
+	}
+	int *b=(int*)malloc(size*4);
+	for(int i=0;i<size;i++)
+	{
+		*(b+i)=*(a+i);
+	}
+	insertUp(b,size);
+	printf("Elements in Array b\n");
+	for(int i=0;i<size;i++)
+	{
+		printf("%d\n",*(b+i));
+	}
+	int *c=(int*)malloc(size*4);
+	printf("Elements in Array c\n");
+	for(int i=0;i<size;i++)
+	{
+		*(c+i)=*(a+i);
+	}
+	insertDn(c,size);
+	for(int i=0;i<size;i++)
+	{
+		printf("%d\n",*(c+i));
+	}
+	free(a);
+	free(b);
+	free(c);
+	return 0;
+}
+void insertDn(int*n,int size)
+{
+	for(int i=0;i<size;i++)
+	{
+		for(int j=i;j<size;j++)
+		{
+			if(*(n+i)<*(n+j))
+			{
+				int temp=*(n+i);
+				*(n+i)=*(n+j);
+				*(n+j)=temp;
+			}
+		}
+	}
+}
+void insertUp(int*n,int size)
+{
+	for(int i=size-1;i>-1;i--)
+	{
+		for(int j=i;j>-1;j--)
+		{
+			if(*(n+i)<*(n+j))
+			{
+				int temp=*(n+i);
+				*(n+i)=*(n+j);
+				*(n+j)=temp;
+			}
+		}
+	}
+}