COMP2113
COMP2113_ENGG1340 Programming technologies and Computer programming II [Section 2BC] [2023]
Loading...
Searching...
No Matches
sort.cpp
Go to the documentation of this file.
1
#include <iostream>
2
#include <iomanip>
3
using namespace
std;
4
5
6
void
swap
(
int
&,
int
&);
7
void
sort
(
int
[],
int
);
8
void
print_array
(
const
int
[],
int
);
9
10
int
main
()
11
{
12
const
int
arraySize = 6;
// size of array
13
int
a[ arraySize ] = {-2, 7, 0, 23, 2048, -46};
// declare array a
14
15
cout <<
"Original array:\n"
;
16
print_array
( a, arraySize );
17
18
sort
( a, arraySize );
19
20
cout <<
"Sorted array:\n"
;
21
print_array
( a, arraySize );
22
23
return
0;
24
}
25
26
27
void
print_array
(
const
int
array[],
int
sizeOfArray )
28
{
29
for
(
int
i = 0; i < sizeOfArray; ++i )
30
cout <<
"["
<< setw(2) << i <<
"] "
;
31
cout << endl;
32
33
for
(
int
i = 0; i < sizeOfArray; ++i )
34
cout << setw(3) << array[i] <<
" "
;
35
cout << endl;
36
}
37
38
39
// sort values in array[] in ascending order by selection sort
40
void
sort
(
int
array[],
int
sizeOfArray )
41
{
42
int
i, j, idx;
43
int
min;
44
45
for
( i = 0; i < sizeOfArray; ++i )
46
{
47
min = array[i];
48
idx = i;
49
for
( j = i + 1; j < sizeOfArray; ++j )
50
{
51
if
( array[j] < min )
52
{
53
min = array[j];
54
idx = j;
55
}
56
}
57
if
( idx != i )
58
swap
( array[i], array[idx] );
// swap values
59
}
60
}
61
62
void
swap
(
int
&a,
int
&b)
63
{
64
int
tmp = a;
65
a = b;
66
b = tmp;
67
return
;
68
}
69
sort
void sort(int[], int)
Definition
sort.cpp:40
swap
void swap(int &, int &)
Definition
sort.cpp:62
print_array
void print_array(const int[], int)
Definition
sort.cpp:27
main
int main()
Definition
sort.cpp:10
Module6
Sample Code
Part I - Array
sort.cpp
Generated on Sun Sep 29 2024 16:39:53 for COMP2113 by
1.12.0