Counting duplicate number in an array- implimented BST

[IZZI]

This code is created to find all duplicates in a list of number by using a binary search tree implemented as an array. I want to add a function to count how many numbers in the list are duplicated but i dont know where to put it. It's really confusing. One more, i want to increase my array size to 5,000,000 but the program doesnt work.I dont know how to fix it. Plz help me.Thanks 4 advance.

#include <stdlib.h> 
#include <stdio.h> 
#include <conio.h>
 
#define TRUE 1 
#define FALSE 0 
#define TOTAL_SLOTS 500000     
 
struct nodetype 
{ 
long int info; 
long int used; 
}node[TOTAL_SLOTS] ; 
 
//initialize a tree
void initialize (); 
void initialize() 
{ 
     long int i; 
     for (i = 0; i<TOTAL_SLOTS; i++) 
         node[i].used = FALSE;                 //mark every node as unused
} 
 
//add node to the tree  
void addnode (long int node_id,long int value) ;  
void addnode (long int node_id,long int value ) 
 
{ 
 
       node[node_id].info = value;            //assign the value of the number to the appropriate node_id in the tree
       node[node_id].used = TRUE ;            //mark node as used one
 
} 
 
 
 
int main(void) 
 
{
 
//function ask user for the list of numbers      
     printf("To start, please enter the number of elements in the list: ");
     scanf("%d",&n);
 
     for (i=0;i<n;i++)
     {
          printf("Please enter number #%d: ",i+1);
          scanf("%d",&a[i]);
     }
//initialize the tree
     initialize(); 
 
//examine the numbers in the list
     for(i=0;i<n;i++) 
     { 
       node_id=0; 
       while ((node_id < TOTAL_SLOTS)) 
       {
              if (node[node_id].used == FALSE)   //while node_id has not been used
              {
                     addnode(node_id,a[i]);      //add node_id to the binary search tree
                     break;
              } 
              if (a[i] == node[ node_id ].info)   //while current value has already been in the BST
              {
                     printf("\n%d is a duplicate", a[i]); 
                     break; 
              } 
              if (a[i] < node[node_id].info)       //while value is smaller than the root
                     node_id = 2* node_id +1;      //go to the left subtree
 
              else   
                     node_id = 2* node_id +2;      //go to the right subtree
       } 
 
       if (node_id >=TOTAL_SLOTS) 
       {
              printf("overflow error\n"); 
              exit(1); 
       } 
 
} 
getch ();
} 
 
 

[Laharl]

If a long int is 4 bytes, then an array of 5,000,000 of nodes would use up about 8*5000000=40,000,000 bytes. Thus, simply allocating memory for this program would require at least 40MB. Your compiler probably doesn't want to do that.

You can add the function in the same general area as your other functions, after the struct is defined and before main().

Or, you can simply count up how many times <value> "is a duplicate" prints during your main and print that, no function required.

[IZZI]

Thank u very much!
About the function count, I mean that I dont know where to put it in the main function.

[Laharl]

From the looks of it, a function is really not what you want here, unless you want unnecessary overhead associated with calling it. Simply initialize and use an integer to count the number of times you have to print "duplicate value" when you try to insert.