C actually encourages you to move it around using pointer arithmetic. For example, if you say p++;, the compiler knows that p points to an integer, so this statement increments p the appropriate number of bytes to move it to the next element of the array. If p were pointing to an array of 100-byte-long structures, p++; would move p over by 100 ... Here we can access the elements of array using the pointer in the same way as we access the array. Only difference that we can note here is that with array of pointers, we need to use ‘*’ to access the value in the array. If we use intPtr[i], then it will give the address of ith element in the array. function for finding smallest of two array elements using pointers; pointers program to find the minimum element in array using; program in c to find smallest element in an array using pointer ; smallest and greatest number of array using pointers; smallest element from array using pointer in c; smallest in array using pointer; write a c prgrm ... Pointer and Arrays in C. When an array is declared, compiler allocates sufficient amount of memory to contain all the elements of the array. Base address i.e address of the first element of the array is also allocated by the compiler. Linear search in C to find whether a number is present in an array. If it's present, then at what location it occurs. It is also known as a sequential search. It is straightforward and works as follows: we compare each element with the element to search until we find it or the list ends. Linear search for multiple occurrences and using a function.