View difference between Paste ID: <a href="/emQyKLfJ">emQyKLfJ</a> and <a href="/RSy7mWVu">RSy7mWVu</a>

  1 #include <stdio.h>
1	-	1 #include <stdio.h>
1	+	#include <stdio.h>
2	-	2 #define SIZE 5
2	+	#define SIZE 5
3	-	3
3	+
4	-	4 void loadArray(int array[], int n);
4	+	void loadArray(int array[], int n);
5	-	5 void printArray(int array[], int n);
5	+	void printArray(int array[], int n);
6	-	6 void sortArray(int array[], int n);
6	+	void sortArray(int array[], int n);
7	-	7 int searchArray(int array[], int n);
7	+	int searchArray(int array[], int n);
8	-	8 void addToArray(int array[], int n, int val);
8	+	void addToArray(int array[], int n, int val);
9	-	9 void multiplyArray(int array[], int n, int val);
9	+	void multiplyArray(int array[], int n, int val);
10	-	10
10	+
11	-	11 int main(void)
11	+	int main(void)
12	-	12 {
12	+	{
13	-	13 int n = SIZE;
13	+	int n = SIZE;
14	-	14 int array[n];
14	+	int array[n];
15	-	15 int menu_option;
15	+	int menu_option;
16	-	16 int val;
16	+	int val;
17	-	17
17	+
18	-	18 loadArray(array, n);
18	+	loadArray(array, n);
19	-	19 printf("What would you like to do?\n");
19	+	printf("What would you like to do?\n");
20	-	20 printf("1) Print the array\n");
20	+	printf("1) Print the array\n");
21	-	21 printf("2) Sort the array\n");
21	+	printf("2) Sort the array\n");
22	-	22 printf("3) Search the array\n");
22	+	printf("3) Search the array\n");
23	-	23 printf("4) Add to the array\n");
23	+	printf("4) Add to the array\n");
24	-	24 printf("5) Multiply the array\n");
24	+	printf("5) Multiply the array\n");
25	-	25 printf("0) Exit\n");
25	+	printf("0) Exit\n");
26	-	26 scanf("%d", &menu_option);
26	+	scanf("%d", &menu_option);
27	-	27
27	+
28	-	28 while (menu_option != 0)
28	+	while (menu_option != 0)
29	-	29 {
29	+	{
30	-	30 switch (menu_option)
30	+	switch (menu_option)
31	-	31 {
31	+	{
32	-	32 case 1:
32	+	case 1:
33	-	33 printArray(array, n);
33	+	printArray(array, n);
34	-	34 break;
34	+	break;
35	-	35
35	+
36	-	36 case 2:
36	+	case 2:
37	-	37 sortArray(array, n);
37	+	sortArray(array, n);
38	-	38 break;
38	+	break;
39	-	39
39	+
40	-	40 case 3:
40	+	case 3:
41	-	41 searchArray(array, n);
41	+	searchArray(array, n);
42	-	42 break;
42	+	break;
43	-	43
43	+
44	-	44 case 4:
44	+	case 4:
45	-	45 addToArray(array, n, val);
45	+	addToArray(array, n, val);
46	-	46 break;
46	+	break;
47	-	47
47	+
48	-	48 case 5:
48	+	case 5:
49	-	49 multiplyArray(array, n, val);
49	+	multiplyArray(array, n, val);
50	-	50 break;
50	+	break;
51	-	51
51	+
52	-	52 case '\n':
52	+	case '\n':
53	-	53 case '\t':
53	+	case '\t':
54	-	54 case ' ':
54	+	case ' ':
55	-	55 case default:
55	+	break;
56	-	56 printf("Please enter 1, 2, 3, 4, or 5; or 0 to exit: ");
56	+
57	-	57 break;
57	+	default:
58	-	58
58	+	printf("Please enter 1, 2, 3, 4, or 5; or 0 to exit: ");
59	-	59 }
59	+	break;
60	-	60
60	+
61	-	61 void loadArray(int array[], int n)
61	+	}
62	-	62 {
62	+	}
63	-	63 int n_one;
63	+	}
64	-	64 int i = 0; //counter variable
64	+	void loadArray(int array[], int n)
65	-	65 for(i=0; i<n; i++)
65	+	{
66	-	66 {
66	+	int n_one;
67	-	67 printf("Enter value %d: ", &i);
67	+	int i = 0; //counter variable
68	-	68 scanf("%d", &array[i]);
68	+	for(i=0; i<n; i++)
69	-	69 }
69	+	{
70	-	70 }
70	+	printf("Enter value %d: ", &i);
71	-	71
71	+	scanf("%d", &array[i]);
72	-	72 void printArray(int array[], int n)
72	+	}
73	-	73 {
73	+	}
74	-	74
74	+
75	-	75 int i = 0;
75	+	void printArray(int array[], int n)
76	-	76 for (i = 0; i < n; i++)
76	+	{
77	-	77 {
77	+
78	-	78 printf("Array[%d] = %d\n", i, array[i]);
78	+	int i = 0;
79	-	79 }
79	+	for (i = 0; i < n; i++)
80	-	80 }
80	+	{
81	-	81
81	+	printf("Array[%d] = %d\n", i, array[i]);
82	-	82 void sortArray(int array[], int n)
82	+	}
83	-	83 {
83	+	}
84	-	84 int pass; //passes counter
84	+
85	-	85 int i; //comparison counter
85	+	void sortArray(int array[], int n)login as: asm3kf
86	-	86 int hold; //temporary location used to swap array elements
86	+	{
87	-	87 for (pass = 1; pass < n; pass++)
87	+	int pass; //passes counter
88	-	88 {
88	+	int i; //comparison counter
89	-	89 for (i = 0; i < (n-1); i++)
89	+	int hold; //temporary location used to swap array elements
90	-	90 {
90	+	for (pass = 1; pass < n; pass++)
91	-	91 if (array[i] > array[i + 1])
91	+	{
92	-	92 {
92	+	for (i = 0; i < (n-1); i++)
93	-	93 hold = array[i];
93	+	{
94	-	94 array[i] = array[i + 1];
94	+	if (array[i] > array[i + 1])
95	-	95 array[i + 1] = hold;
95	+	{
96	-	96 }
96	+	hold = array[i];
97	-	97 }
97	+	array[i] = array[i + 1];
98	-	98 }
98	+	array[i + 1] = hold;
99	-	99 //output the array in a sorted state
99	+	}
100	-	100 for(i = 0; i < n; i++)
100	+	}
101	-	101 {
101	+	}
102	-	102 printf("Array[%d] = %d\n", i, array[i]);
102	+	//output the array in a sorted state
103	-	103 }
103	+	for(i = 0; i < n; i++)
104	-	104 }
104	+	{
105	-	105
105	+	printf("Array[%d] = %d\n", i, array[i]);
106	-	106 /*int searchArray(int array[], int n, int val)
106	+	}
107	-	107 {
107	+	}
108	-	108 //value to be located in array
108	+
109	-	109 int element; //variable to hold location of searchKey or -1
109	+	/*int searchArray(int array[], int n, int val)
110	-	110
110	+	{
111	-	111 printf("Enter a number to search for: ");
111	+	//value to be located in array
112	-	112 scanf("%d", val );
112	+	int element; //variable to hold location of searchKey or -1
113	-	113
113	+
114	-	114 //look for searchKey in array
114	+	printf("Enter a number to search for: ");
115	-	115 element = searchArray;
115	+	scanf("%d", val );
116	-	116 }
116	+
117	-	117 */
117	+	//look for searchKey in array
118	-	118
118	+	element = searchArray;
119	-	119 /*void addToArray(int array[], int n, int val)
119	+	}
120	-	120 {
120	+	*/
121	-	121
121	+
122	-	122 int i;
122	+	/*void addToArray(int array[], int n, int val)
123	-	123
123	+	{
124	-	124 printf("Enter a number to add to each element of the array: ");
124	+
125	-	125 scanf("%d", val);
125	+	int i;
126	-	126 for(i = 0; i < n; i++)
126	+
127	-	127 {
127	+	printf("Enter a number to add to each element of the array: ";
128	-	128 array[i] = i + val;
128	+	scanf("%d", val);
129	-	129 }
129	+	for(i = 0; i<n; i++)
130	-	130 printf("Modified array:\n");
130	+	{
131	-	131 for (i = 0; i < n; i++)
131	+	array[i] = i + val;
132	-	132 {
132	+	}
133	-	133 printf("Array[%d] = %d\n", i, array[i]);
133	+	printf("Modified array:\n");
134	-	134 }
134	+	for (i = 0; i < n; i++)
135	-	135 } */
135	+	{
136		printf("Array[%d] = %d\n", i, array[i]);
137		}
138		*/}