AfanasevGad7

This is a task for our favourite professor
git clone git://git.stellar-nexus.ru/AfanasevGad7
Log | Files | Refs | README

commit fc82de5655e14add4985435073ddca56898c4fb4
parent 76d80c1511761e18a893e2ff092434f777d04d74
Author: Plat <plat@stellar-nexus.ru>
Date:   Thu,  6 Nov 2025 21:23:39 +0000

Fixed segfault in testing sequence

Diffstat:
Mrb.c | 4++--
1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/rb.c b/rb.c @@ -128,7 +128,7 @@ main(int argc, char *argv[]) if (len < TESTNUMBER) eprintf("Array too small\n"); if (len > TESTNUMBER) - weprintf("Array too big - using only %d elements\n", TESTNUMBER); + weprintf("Array too big - using only the first %d elements\n", TESTNUMBER); Node *root = NULL; @@ -140,7 +140,7 @@ main(int argc, char *argv[]) /* Searching for every possible value */ clock_t start_time, end_time; start_time = clock(); - for (int i = 0; i <= TESTNUMBER; ++i) + for (int i = 0; i < TESTNUMBER; ++i) search(root, arr[i]); end_time = clock(); printf("%f\n", (double)(end_time-start_time)/CLOCKS_PER_SEC);