-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathheader.cpp
More file actions
102 lines (81 loc) · 1.94 KB
/
header.cpp
File metadata and controls
102 lines (81 loc) · 1.94 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include "Header.h"
void printarr(int arr[], int size)
{
printf("Array with size of %d \n[", size);
for(int i = 0; i < size; i++) printf("%d, ", arr[i]);
printf("\b\b] \n");
}
void swap(int* a, int* b)
{
int temp = *a;
*a = *b;
*b = temp;
}
int* exercise1(int arr1[], int size1, int arr2[], int size2)
{
static int arr[50] = {0};
for (int i = 0; i < size1; i++) arr[i] = arr1[i];
for (int i = 0; i < size2; i++) arr[size1 + i] = arr2[i];
return arr;
}
int* exercise22(int arr1[], int size1, int arr2[], int size2)
{
static int arr[50] = {0};
int count = 0;
for (int i = 0; i < size1; i++)
{
for (int j = 0; j < size2; j++)
{
if (arr1[i] == arr2[j])
{
arr[count++] = arr1[i];
break;
}
}
}
return arr;
}
int* exercise32(int arr1[], int size1, int arr2[], int size2)
{
static int arr[50] = {0};
int count = 0, inserted = 0;
for (int i = 0; i < size1; i++)
{
for (int j = inserted; j < size2 && arr2[j] < arr1[i]; j++)
{
inserted = j + 1;
arr[count++] = arr2[j];
}
arr[count++] = arr1[i];
}
for (int i = inserted; i < size2; i++)
arr[count++] = arr2[i];
return arr;
}
void exercise42a(int arr[], int size, int num)
{
for (int i = 0; i < size; i++)
{
if (arr[i] < num)
{
for (int j = i; j < size; j++)
swap(&arr[j], &num);
break;
}
}
}
int* exercise42b(int arr[], int size)
{
static int ans[50] = {};
for (int i = 0; i < size; i++) exercise42a(ans, size, arr[i]);
return ans;
}
void exercise52(int arr[], int size)
{
for (int i = size; i > 0; i--)
for (int j = 1; j < i; j++)
if (arr[j - 1] > arr[j])
swap(&arr[j - 1], &arr[j]);
}