How to use Arrays, pointers and Recursion In C Programming

Arrays a kind of data structure that can store a fixed-size sequential collection of elements of the same type. An array is used to store a collection of data, but it is often more useful to think of an array as a collection of variables of the same type.
All arrays consist of contiguous memory locations. The lowest address corresponds to the first element and the highest address to the last element.

To declare an array in C, a programmer specifies the type of the elements and the number of elements required by an array.
You can initialize an array in C either one by one or using a single statement.
An element is accessed by indexing the array name. This is done by placing the index of the element within square brackets after the name of the array.
C programming language allows multidimensional arrays.
The simplest form of multidimensional array is the two-dimensional array. A two-dimensional array is, in essence, a list of one-dimensional arrays.

Pointers in C are easy and fun to learn. Some C programming tasks are performed more easily with pointers, and other tasks, such as dynamic memory allocation, cannot be performed without using pointers. So it becomes necessary to learn pointers to become a perfect C programmer. Let's start learning them in simple and easy steps.
As you know, every variable is a memory location and every memory location has its address defined which can be accessed using ampersand & operator, which denotes an address in memory.
A pointer is a variable whose value is the address of another variable, i.e., direct address of the memory location. Like any variable or constant, you must declare a pointer before using it to store any variable address.

Recursion is the process of repeating items in a self-similar way. In
programming languages, if a program allows you to call a function inside the same function, then it is called a recursive call of the function.The C programming language supports recursion, i.e., a function to call itself.
But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop. Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.

[heer]

Thank u... This video is very helpful 👍

[aneesmufti]

Thanks fo the great tutorial!!
I found this video very helpful and i now understand the concepts a lot better😁😁
Keep up the great work👍🏻👍🏻

[usamaali]

I have a confusion??
What is a purpose of Recursion??
How recursive function is compiled by compiler??
Is recursive solution is better or Iterative solution and why??

[fakhruddinaziz]

I think you should make videos in hindi rather english this would be more helpful for viewer