Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Server Side Programming Articles
Page 910 of 2109
C Program to insert an array element using pointers.
In C programming, inserting elements into an array using pointers involves dynamically allocating memory and manipulating array elements through pointer arithmetic. This technique is useful when you need to add elements at specific positions during runtime. Syntax void insertElement(int *array, int size, int position, int element); int *ptr = (int*)malloc(size * sizeof(int)); Algorithm The algorithm to insert elements into an array using pointers − Declare and read the array size Allocate memory dynamically using malloc() Input array elements using pointer notation Read the insertion position and new element Validate position (must be ...
Read MoreC program to sort an array in an ascending order
In C programming, sorting an array in ascending order means arranging elements from smallest to largest value. This is a fundamental operation that can be implemented using various algorithms, with bubble sort being one of the most commonly taught approaches. Syntax // Basic bubble sort algorithm for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { if (arr[i] > arr[j]) { // Swap ...
Read MoreC program to sort an array in descending order
Sorting an array in descending order means arranging elements from highest to lowest value. This is commonly achieved using various sorting algorithms, with bubble sort being one of the simplest approaches. Syntax // Bubble sort for descending order for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { if (arr[i] < arr[j]) { // Swap elements ...
Read MoreC program to find the unique elements in an array.
In C programming, finding unique elements in an array means identifying elements that appear exactly once. This is a common array manipulation problem that can be solved using nested loops to compare each element with all other elements. Syntax for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { if(array[i] == array[j] && i != j) break; } ...
Read MoreC program for a number to be expressed as a sum of two prime numbers.
In C, we can check if a given positive integer can be expressed as the sum of two prime numbers. This concept is related to Goldbach's conjecture, which states that every even integer greater than 2 can be expressed as the sum of two primes. Syntax int isPrime(int n); // Returns 1 if n is prime, 0 otherwise Algorithm The algorithm to check if a number can be expressed as sum of two primes is − Step 1: Input the number to be checked Step 2: Iterate from i = 2 to ...
Read MoreC program to find the solution of linear equation
We can apply the software development method to solve the linear equation of one variable in C programming language. A linear equation of the form ax + b = 0 can be solved by rearranging to find x = -b/a (provided a ≠ 0). Syntax float solve(float a, float b); x = -b / a; // where a != 0 Requirements The equation should be in the form of ax + b = 0 a and b are inputs, we need to find the value of x Handle the case where a ...
Read MoreC program to replace all zeros with one in a given integer.
In C programming, replacing all zeros with ones in an integer requires digit-by-digit processing. This can be achieved using recursion or iterative approaches to extract, modify, and reconstruct the number. Syntax int replaceZeros(long int number); Algorithm Follow these steps to replace all zeros with ones in an integer − Step 1 − Input the integer from the user Step 2 − Traverse the integer digit by digit Step 3 − If a zero is encountered, replace it with one Step 4 − Reconstruct and return the modified number Method 1: ...
Read MoreC program to compare the structure variables
In C programming language, a structure is a collection of different datatype variables, which are grouped together under a single name. While C doesn't provide a built-in operator to compare entire structures directly, we can compare structure variables by comparing their individual members. Syntax struct tagname { datatype member1; datatype member2; datatype membern; }; Structure Declaration and Initialization The general form of a structure declaration is as follows − struct tagname { datatype member1; ...
Read MoreExplain queue by using linked list in C language
A queue is a linear data structure that follows the First In First Out (FIFO) principle. When implemented using linked lists, we can avoid queue overflow and underflow issues that occur with array-based implementations. The linked list provides dynamic memory allocation, allowing the queue to grow or shrink as needed. Operations carried out on a queue using linked lists in C programming language are as follows − Enqueue − Insert an element at the rear Dequeue − Remove an element from the front Display − Show all elements in the queue Front − Get the front element ...
Read MoreExplain the stack by using linked list in C language
A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle. When implementing a stack using a linked list in C, we can avoid stack overflow and underflow issues by dynamically allocating memory. This approach provides flexibility in memory usage and can grow or shrink based on requirements. Syntax struct node { int data; struct node *next; } *top; void push(int value); void pop(); int peek(); int isEmpty(); Stack Operations The primary operations performed on a stack using linked list are − ...
Read More