ProgrammingThis forum is for all programming questions.
The question does not have to be directly related to Linux and any language is fair game.
Welcome to LinuxQuestions.org, a friendly and active Linux Community.
You are currently viewing LQ as a guest. By joining our community you will have the ability to post topics, receive our newsletter, use the advanced search, subscribe to threads and access many other special features. Registration is quick, simple and absolutely free. Join our community today!
Note that registered members see fewer ads, and ContentLink is completely disabled once you log in.
If you have any problems with the registration process or your account login, please contact us. If you need to reset your password, click here.
Having a problem logging in? Please visit this page to clear all LQ-related cookies.
Introduction to Linux - A Hands on Guide
This guide was created as an overview of the Linux Operating System, geared toward new users as an exploration tour and getting started guide, with exercises at the end of each chapter.
For more advanced trainees it can be a desktop reference, and a collection of the base knowledge needed to proceed with system and network administration. This book contains many real life examples derived from the author's experience as a Linux system and network administrator, trainer and consultant. They hope these examples will help you to get a better understanding of the Linux system and that you feel encouraged to try out things on your own.
Click Here to receive this Complete Guide absolutely free.
because if you have an int array then obviously it's size is known, but a pointer is more flexible and as such all you define for a pointer is a starting place, and so you'd then need to give the program some idea of how long that memory space is meant to be.
In fact, dynamic or static variable, it's nearly the same. It's all about allocation (maybe a bit different, but still..).
A pointer is an address in memory in fact. But when ou use a normal variable, compiler changes its nice name into an adress...
When you use a pointer, you get a place in memory enough to keep an address. Then you use a function to assign space. One of the parameres will be the size you need. After using it, you have to free the memory (AFAIK in Java you don't have to, am I right?).
Then an array. There's also allocation, but the size is taken directly from your code (during compilation, when running, you can't change it). After use, you don't have to free it (because of the defaults).
So, pointers and arrays - it's the same. When processing an array, your compiler uses some defaults, that's the only difference.
Distribution: Red Hat Enterprise Linux 3.0 Advanced Server
using the combination of pointers and memory allocations & free, you can achieve the concept of dynamic arrays & stretchable arrays, where as using arrays in 'C' you can implement only static arrays. ofcourse with pointers execution time is high, where as with arrays we can realise superfast programs.
if you want super compact programs, go for pointers.
if you want super fast programs , go for arrays.
(with arrays address binding takes place at compilation time, where as with pointers address binding takes place at run time.)
there exactly lies the difference between the pointers and arrays.