Home/ Questions/Q 7181017
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-28T17:28:09+00:00

I need to write a function that can read a file, and add all

  • 0

I need to write a function that can read a file, and add all of the unique words to a dynamically allocated array. I know how to create a dynamically allocated array if, for instance, you are asking for the number of entries in the array:

int value;
cin >> value;
int *number;
number = new int[value];

My problem is that I don’t know ahead of time how many unique words are going to be in the file, so I can’t initially just read the value or ask for it. Also, I need to make this work with arrays, and not vectors. Is there a way to do something similar to a push_back using a dynamically allocated array?

Right now, the only thing I can come up with is first to create an array that stores ALL of the words in the file (1000), then have it pass through it and find the number of unique words. Then use that value to create a dynamically allocated array which I would then pass through again to store all the unique words. Obviously, that solution sounds pretty overboard for something that should have a more effective solution.

Can someone point me in the right direction, as to whether or not there is a better way? I feel like this would be rather easy to do with vectors, so I think it’s kind of silly to require it to be an array (unless there’s some important thing that I need to learn about dynamically allocated arrays in this homework assignment).

EDIT: Here’s another question. I know there are going to be 1000 words in the file, but I don’t know how many unique words there will be. Here’s an idea. I could create a 1000 element array, write all of the unique words into that array while keeping track of how many I’ve done. Once I’ve finished, I could provision a dynamically allocate a new array with that count, and then just copy the words from the initial array to the second. Not sure if that’s the most efficient, but with us not being able to use vectors, I don’t think efficiency is a huge concern in this assignment.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    A vector really is a better fit for this than an array. Really.

    But if you must use an array, you can at least make it behave like a vector :-).

    Here’s how: allocate the array with some capacity. Store the allocated capacity in a “capacity” variable. Each time you add to the array, increment a separate “length” variable. When you go to add something to the array and discover it’s not big enough (length == capacity), allocate a second, longer array, then copy the original’s contents to the new one, then finally deallocate the original.

    This gives you the effect of being able to grow the array. If performance becomes a concern, grow it by more than one element at a time.

    Congrats, after following these easy steps you have implemented a small subset of std::vector functionality atop an array!

    • 0