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 55 of 96
Binary representation of next greater number with same number of 1's and 0's in C Program?
In C programming, finding the binary representation of the next greater number with the same number of 1's and 0's is a classic problem that can be solved using a next-permutation approach. Given a binary string, we need to find the smallest binary number that is greater than the given number and contains exactly the same count of 0's and 1's. Syntax char* nextBinary(char* bin); Algorithm The algorithm works in two main steps − Find the rightmost '01' pattern and swap it to '10' Rearrange all bits after the swap position to ...
Read MoreBFS using vectors & queue as per the algorithm of CLRS in C Program?
In graph theory, BFS (Breadth-First Search) is a fundamental traversal algorithm described in CLRS (Introduction to Algorithms). It explores vertices level by level using a queue data structure and maintains vertex states using colors. Syntax void BFS(int graph[][MAX_VERTICES], int vertices, int source); Algorithm The CLRS BFS algorithm uses the following pseudocode − BFS(G, s) - begin for each vertex u in G.V - {s}, do u.color := white u.d := infinity ...
Read MoreBetrothed numbers in C Program?
Betrothed numbers are a special pair of numbers where the sum of proper divisors of one number equals one more than the other number. These mathematical curiosities demonstrate interesting relationships between divisibility and number theory. Syntax int sumOfProperDivisors(int n); void findBetrothedPairs(int limit); Understanding Betrothed Numbers For example, the pair (48, 75) are betrothed numbers − Proper divisors of 48: {1, 2, 3, 4, 6, 8, 12, 16, 24}, sum = 76 Proper divisors of 75: {1, 3, 5, 15, 25}, sum = 49 Since 76 = 75 + 1 and 49 = ...
Read MoreBaum Sweet Sequence in C Program?
The Baum Sweet Sequence is a binary sequence where each term is determined by analyzing the binary representation of a number. If a number n has any block of consecutive zeros with odd length in its binary form, then the nth term is 0, otherwise it is 1. For example, if the number is 4, its binary representation is 100. This has one block of two consecutive zeros (even length), so the 4th term of the Baum Sweet sequence is 1. Syntax int baumSweetTerm(int n); Algorithm The algorithm works as follows − ...
Read MoreAuxiliary Space with Recursive Functions in C Program?
Here we will see how auxiliary space is required for recursive function calls and how it differs from normal function calls in terms of memory usage. Syntax returnType functionName(parameters) { // Base case if (condition) return baseValue; // Recursive case return functionName(modifiedParameters); } Recursive Function Example Consider a recursive factorial function − #include long fact(int n) { if (n == 0 || ...
Read MoreArray range queries for elements with frequency same as value in C Program?
In C programming, array range queries for elements with frequency same as value is a problem where we need to find how many elements in a given range appear exactly as many times as their value. For example, if element 3 appears 3 times in the range, it contributes to our answer. Syntax int query(int start, int end, int arr[], int n); Algorithm The approach uses frequency counting within the specified range − Begin create frequency map for elements in range [start, end] count ...
Read MoreArea of the biggest possible rhombus that can be inscribed in a rectangle in C Program?
Here we will see one problem, where one rectangle is given. We have to find the area of largest rhombus that can be inscribed in the rectangle. Rectangle Inscribed Rhombus Length (l) Breadth (b) ...
Read MoreArea of squares formed by joining mid points repeatedly in C Program?
In this problem, we create a series of squares by repeatedly connecting the midpoints of the sides of the previous square. Given an initial square with side length 'a' and the number of iterations 'n', we need to find the area of the nth square. Side = a Side = a/√2 ...
Read MoreArea of largest triangle that can be inscribed within a rectangle in C Program?
Suppose one rectangle is given. We know the length L and breadth B of it. We have to find the area of largest triangle that can be inscribed within that rectangle − Length (L) Breadth (B) The largest triangle that can be inscribed within ...
Read MoreC Program for area of hexagon with given diagonal length?
Here we will see how to get the area of one hexagon using diagonal length. The diagonal length of the hexagon is d. d ...
Read More