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
C Articles
Page 11 of 96
Find the largest number in a series by using pointers in C language
A pointer is a variable that stores the address of another variable. Instead of holding a value directly, it holds the memory address where the value is stored. Pointers use the dereferencing operator (*) to access the value and the address operator (&) to obtain memory addresses. In this tutorial, we'll learn how to find the largest number in a series using pointers in C programming. Syntax datatype *pointer_name; pointer_name = &variable_name; Where the asterisk (*) declares a pointer and the ampersand (&) gets the address of a variable. Algorithm Here's the ...
Read MoreC program to sort an array by using merge sort
Merge sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts each half separately, and then merges the sorted halves back together. It guarantees O(n log n) time complexity in all cases. Syntax void MergeSort(int array[], int left, int right); void Merge(int array[], int left, int middle, int right); How Merge Sort Works The merge sort algorithm follows these steps − Divide: Split the array into two halves at the middle point Conquer: Recursively sort both halves Combine: Merge the two sorted halves into a single sorted array ...
Read MoreC program to delete an array element using Pointers
In C, deleting an element from an array involves shifting all subsequent elements one position to the left. This operation can be efficiently implemented using pointers to manipulate array elements directly through memory addresses. Syntax void deleteElement(int *array, int size, int position); // array: pointer to the array // size: current size of the array // position: 1-based position of element to delete Algorithm The algorithm to delete an element from an array using pointers − Declare and read the array size Allocate memory dynamically using malloc() Input array elements Read the ...
Read MoreC 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 More