summaryrefslogtreecommitdiff
path: root/linear.c
diff options
context:
space:
mode:
Diffstat (limited to 'linear.c')
-rw-r--r--linear.c7
1 files changed, 4 insertions, 3 deletions
diff --git a/linear.c b/linear.c
index fe19af8..32d5af6 100644
--- a/linear.c
+++ b/linear.c
@@ -1,6 +1,7 @@
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
+#include <stdbool.h>
#include <string.h>
#include <math.h>
#include <limits.h>
@@ -77,7 +78,7 @@ DoLU(void)
int n;
int i;
static int num_arrays = 0;
- static int is_adjusted = FALSE;
+ static bool is_adjusted = false;
/*
** Our first step is to build a "solvable" problem. This
@@ -107,8 +108,8 @@ DoLU(void)
** auto-adjust. If so, repeatedly call the DoLUIteration routine,
** increasing the number of solutions per iteration as you go.
*/
- if (is_adjusted == FALSE) {
- is_adjusted = TRUE;
+ if (is_adjusted == false) {
+ is_adjusted = true;
for(i=1;i<=ARRAY_MAX;i++)
{