codex
Toggle main menu visibility
Main Page
Related Pages
Namespaces
Namespace List
Namespace Members
All
_
a
b
c
d
e
f
g
i
l
m
n
o
p
r
s
t
v
w
x
y
z
Functions
a
b
c
d
e
f
g
i
l
m
o
p
r
s
t
w
x
z
Variables
_
a
b
c
f
g
l
m
n
r
s
t
v
y
Typedefs
Enumerations
Concepts
Classes
Class List
Class Index
Class Hierarchy
Class Members
All
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
~
Functions
a
b
c
d
e
f
g
i
l
m
n
o
p
r
s
t
u
v
w
x
~
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
Enumerations
Enumerator
Files
File List
File Members
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
i
l
m
n
o
p
q
r
s
t
u
v
w
x
Variables
a
b
c
d
e
f
h
i
j
m
n
o
p
r
s
t
u
v
Typedefs
Enumerations
Enumerator
b
c
e
k
m
n
p
q
r
s
w
Macros
a
b
c
d
e
f
g
h
i
j
l
m
n
o
p
q
r
s
t
v
w
x
y
z
•
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Macros
Pages
Concepts
Loading...
Searching...
No Matches
utils.h
Go to the documentation of this file.
1
#include <stdbool.h>
2
3
bool
is_sorted
(
const
int
*
b
,
const
int
*e) {
4
if
(
b
== e)
5
return
true
;
6
while
(++
b
!= e)
7
if
(!(
b
[-1] <
b
[0]))
8
return
false
;
9
return
true
;
10
}
3
bool
is_sorted
(
const
int
*
b
,
const
int
*e) {
…
}
11
12
bool
lsearch
(
const
int
*
b
,
const
int
*e,
int
x
) {
13
for
(;
b
!= e; ++
b
)
14
if
(*
b
==
x
)
15
return
true
;
16
return
false
;
17
}
12
bool
lsearch
(
const
int
*
b
,
const
int
*e,
int
x
) {
…
}
b
static const struct board b
Definition
chess0.c:57
x
#define x
Definition
gcc14.c:1
b
Definition
mult_inh.c:26
lsearch
bool lsearch(const int *b, const int *e, int x)
Definition
utils.h:12
is_sorted
bool is_sorted(const int *b, const int *e)
Definition
utils.h:3
tex
algo
fundamentals
utils.h
Generated by
1.11.0