/* www.troubleshootyourself.com C program to reverse an array elements. */ #includeint main() { int i, d, n, a, b; printf("\nEnter the number of array elements:"); scanf("%d", &n); printf("\nEnter the elements\n", n); for(i = 0; i ...

Selection sort is more efficient than bubble sort and the insertion sort.

/* www.troubleshootyourself.com C program to sort an Array in Descending order using Bubble Sort */ #include #define MAX 100 int main() { int arr, maxLimit; int i,j,temp; printf("Enter total number of elements to sort: "); ...

/* www.troubleshootyourself.com C program to sort an Array in Ascending order using Bubble Sort */ #include #define MAX 100 int main() { int arr, maxLimit; int i,j,temp; printf("Enter total number of elements to sort: "); ...

/* www.troubleshootyourself.com Program to reverse String using Stack */#include #include/* Set maximum number of charecters */ #define MAX 100/* Stack variables */ int top=-1; int item;/* String array variable to store string char*/ char ...

/* www.troubleshootyourself.com C Program to demonstrate stack implementation using structures. */#include #define MAX 100 /* structure declaration */ typedef struct { int element; int TOP; }STACK; STACK *s; /* Function to insert an item ...

/* www.troubleshootyourself.com C Program to demonstrate stack implementation using array */#include #include #define MAX 10 int STACK,TOP; /* display stack element*/ void display(int ); /* push (insert) item into stack*/ void Push(int ,int); ...

In this article I would like to provide few tips related to memory management when we use C libraries malloc(), calloc() and free() functions.Whenever possible, try to use static buffers where compiler automatically frees such memory. Make sure that, previously allocated ...