String array

[iammark]

I have an array of string: char array[][]. I have sorted it in order and there are many duplicates.

Is there a way to count the duplicate of every string and store them with string:

e.g:
array["help"]->2 //2=number of occurences of "help."

Thanks,
Mark

[bithub]

Yeah, but it's not simple. What it sounds like you want is a hashmap or hashtable. These are data structures where you can look up values based on arbitrary data types (like strings).

This would allow you to do something like:

my_hashtable* ht = create_ht();
ht_put("help", 2);
int value = ht_get("help");

The problem is that you need to implement the data structure yourself (or find an existing implementation online).

Of course you could go the easy route, and just do something like:

struct s
{
    char string[100];
    int num_duplicates;
};

// Now just create a linked list of these structures which tell you the string in 
// question, and the number of duplicates

[iammark]

Thanks. I will look into it tomorrow.

[MisterIO]

Yeah, but it's not simple. What it sounds like you want is a hashmap or hashtable. These are data structures where you can look up values based on arbitrary data types (like strings).

This would allow you to do something like:

my_hashtable* ht = create_ht();
ht_put("help", 2);
int value = ht_get("help");

The problem is that you need to implement the data structure yourself (or find an existing implementation online).

Of course you could go the easy route, and just do something like:

struct s
{
    char string[100];
    int num_duplicates;
};

// Now just create a linked list of these structures which tell you the string in 
// question, and the number of duplicates

An hashtable doesn't seem to be the best data structure for this. This seems like it needs something that in c++ would be called a multiset. If you just need to use something like that, use a multiset if you can use c++, otherwise search for a library that implements a similar data structure in c. If you need to write the data structure by yourself, you could do it for example with a binary tree holding a list on each node, if you absolutely need to store the copies, otherwise you could just put a counter together with the single stored value on each node.