dynamically allocating an array

Im kind of new to C, and I have a question about dynamically allocating arrays.

I created an array, int array[n], but this array cant be bigger than 10, so the user will have to enters a number less than 10, so the array is a fixed size. It also warns the user if he entered n > 10.

But now i want to ask for the size of the array n from the user and dynamically allocate memory for that size of array And by dynamically allocating the array, so there will be no need to warn about size limits.

I think it's similar to previous part, do i just create the array like " new array[n]"?

Have you learned malloc? C Reference function malloc() | CodingUnit Programming Tutorials

The keyword new is not part of the C language :)
malloc is the function you need :) malloc - C++ Reference
Declare the array as a pointer and then malloc the space you need :)

If you are using "new", then you are using a C++ compiler, not a C compiler. They are frequently put into the same package of compilers, but they AREN'T the same, and will lead to a lot of confusion.

C programs should have a file extension on the filename of dot c (.c), whereas C++ programs should have a file extension on their filename of dot cpp (.cpp).

To dynamically allocate an array, you use malloc() in C, "new" does nothing in C. If you want to ask about C++, go to the C++ forum.

Include <stdlib.h> file in your program, and read up on malloc() in your textbook or help feature.

oh ok, yeah i am using C, not C++, so malloc it is

Also look up realloc() - if you need to resize after the first malloc() - and free(), unless you enjoy the prospect of leaking.

Incidentally, malloc() doesn't eliminate the need for checking size limits. The amount of memory available via malloc() is finite .... large, but still finite.

Quote:

---

Originally Posted by grumpy

Also look up realloc() - if you need to resize after the first malloc() - and free(), unless you enjoy the prospect of leaking.

Incidentally, malloc() doesn't eliminate the need for checking size limits. The amount of memory available via malloc() is finite .... large, but still finite.

---

If you use realloc remember to increase the size of the array (which has some advantages in comparison with the linked lists you are going to learn in the future ) to it's double size.It is vital for the performance of your program to always increase by x% (a percentage quantity) every time the array is full and not by a constant quantity.In first case the complexity remains O(n), but in the second case it approaches O(n²) <--that's a critical difference!