Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
U
uva
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Taddeüs Kroes
uva
Commits
df971358
Commit
df971358
authored
14 years ago
by
Taddeüs Kroes
Browse files
Options
Downloads
Patches
Plain Diff
Now using array instead of structs.
parent
1dc110f0
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
modsim/ass2/q7.c
+13
-75
13 additions, 75 deletions
modsim/ass2/q7.c
with
13 additions
and
75 deletions
modsim/ass2/q7.c
+
13
−
75
View file @
df971358
#include
<stdlib.h>
#include
<stdio.h>
#include
<assert.h>
typedef
struct
rabbit
{
unsigned
short
age
;
struct
rabbit
*
prev
,
*
next
;
}
rabbit
;
void
sequence
(
int
n
,
int
max_age
)
{
int
i
,
mature
=
0
,
new
[
n
],
died
=
0
;
rabbit
*
rabbits
=
NULL
;
int
rabbit_count
=
0
;
rabbit
*
rabbit_born
()
{
rabbit
*
r
=
(
rabbit
*
)
malloc
(
sizeof
(
rabbit
));
if
(
(
r
->
next
=
rabbits
)
)
rabbits
->
prev
=
r
;
r
->
age
=
0
;
r
->
prev
=
NULL
;
rabbits
=
r
;
rabbit_count
++
;
return
r
;
}
void
rabbit_die
(
rabbit
**
ptr
)
{
rabbit
*
r
=
*
ptr
;
if
(
r
->
prev
!=
NULL
)
r
->
prev
->
next
=
r
->
next
;
if
(
r
->
next
!=
NULL
)
r
->
next
->
prev
=
r
->
prev
;
if
(
r
==
rabbits
)
rabbits
=
r
->
next
;
else
*
ptr
=
NULL
;
rabbit_count
--
;
free
(
r
);
}
void
sequence
(
int
generations
,
int
max_age
)
{
int
i
;
rabbit
*
r
,
*
next
=
NULL
;
rabbits
=
rabbit_born
();
new
[
0
]
=
1
;
printf
(
"1"
);
for
(
i
=
1
;
i
<
generations
;
i
++
)
{
for
(
r
=
rabbits
;
r
!=
NULL
;
r
=
next
)
{
next
=
r
->
next
;
if
(
r
->
age
++
)
{
rabbit_born
();
for
(
i
=
1
;
i
<
n
;
i
++
)
{
died
=
i
<
max_age
?
0
:
new
[
i
-
max_age
];
new
[
i
]
=
mature
;
mature
=
mature
+
new
[
i
-
1
]
-
died
;
if
(
r
->
age
==
max_age
)
rabbit_die
(
&
r
);
}
}
printf
(
" %d"
,
rabbit_count
);
printf
(
" %d"
,
mature
+
new
[
i
]);
}
puts
(
""
);
while
(
rabbits
)
rabbit_die
(
&
rabbits
);
}
void
sequence_old
(
int
n
)
{
int
i
,
new
=
1
,
new_new
,
mature
=
0
,
died
=
0
;
for
(
i
=
0
;
i
<
n
;
i
++
)
{
printf
(
"%d + %d = %d
\n
"
,
mature
,
new
,
new
+
mature
);
new_new
=
mature
;
mature
=
mature
+
new
-
died
;
new
=
new_new
;
}
}
int
main
(
int
argc
,
char
*
argv
[])
{
...
...
@@ -90,12 +26,14 @@ int main(int argc, char *argv[]) {
return
1
;
}
generations
=
atoi
(
argv
[
1
]);
max_age
=
generations
=
atoi
(
argv
[
1
]);
if
(
argc
>
2
&&
(
max_age
=
atoi
(
argv
[
2
]))
==
1
)
{
puts
(
"MAX_AGE should be at least 2
(or 0 for infinite)
."
);
if
(
argc
>
2
&&
(
max_age
=
atoi
(
argv
[
2
]))
<
2
)
{
puts
(
"MAX_AGE should be at least 2."
);
return
1
;
}
sequence
(
generations
,
max_age
);
return
0
;
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment