PandA-2024.02
Main Page
Related Pages
Modules
+
Namespaces
Namespace List
+
Namespace Members
+
All
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
r
s
t
u
v
w
x
y
z
Functions
+
Variables
a
b
c
d
e
f
g
h
i
j
l
m
n
o
p
r
s
t
v
w
x
y
z
+
Data Structures
Data Structures
Data Structure Index
Class Hierarchy
+
Data Fields
+
All
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
~
+
Functions
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
~
+
Variables
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
+
Typedefs
a
b
c
d
e
f
g
i
k
l
m
n
o
p
r
s
t
u
v
+
Enumerations
a
b
c
d
f
g
i
m
n
o
p
r
s
t
v
+
Enumerator
a
b
c
d
e
f
g
i
l
m
n
o
p
r
s
t
u
v
+
Related Functions
a
b
c
e
f
h
i
l
o
p
r
s
t
u
v
w
+
Files
File List
+
Globals
+
All
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
+
Functions
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
+
Variables
_
a
b
c
d
e
f
h
i
j
k
l
m
n
o
p
q
r
s
t
w
x
y
z
+
Typedefs
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
r
s
t
u
v
w
x
+
Enumerations
a
b
c
d
e
f
h
i
k
l
m
o
p
r
s
t
u
v
+
Enumerator
a
b
c
d
e
f
g
i
k
l
n
o
p
r
s
t
u
v
+
Macros
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
•
All
Data Structures
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Friends
Macros
Modules
Pages
documentation
tutorial_fpl_2022
01-introduction
Exercise2
solution
minmax.c
Go to the documentation of this file.
1
void
min_max
(
int
*
input
,
int
num_elements,
int
*
max
,
int
*
min
)
2
{
3
int
local_max = input[0];
4
int
local_min = input[0];
5
int
i = 0;
6
for
(i = 0; i < num_elements; i++)
7
{
8
if
(input[i] > local_max)
9
{
10
local_max = input[i];
11
}
12
else
if
(input[i] < local_min)
13
{
14
local_min = input[i];
15
}
16
}
17
*min = local_min;
18
*max = local_max;
19
}
input
int input[SIZE]
Definition:
hash.h:1
min
#define min(x, y)
max
#define max
Definition:
backprop.h:17
min_max
void min_max(int *input, int num_elements, int *max, int *min)
Definition:
minmax.c:1
Generated on Mon Feb 12 2024 13:02:47 for PandA-2024.02 by
1.8.13