Skip to main content

Featured

C Program to Solve Two Sum Using Brute Force (With Algorithm & Output)

 Introduction The Two Sum problem is a popular coding interview question where we must find two indices of an array whose values add up to a given target. This program demonstrates a simple brute-force solution in C using nested loops and dynamic memory allocation. Problem Statement Given an integer array and a target value, return the indices of the two numbers such that they add up to the target. Each input has exactly one solution, and the same element cannot be used twice. The result should return the indices, not the values. If no solution exists, return NULL.  Algorithm / Logic Explanation Start the program. Traverse the array using a loop from index 0 to numsSize - 1 . Inside this loop, use another loop starting from i + 1 to numsSize - 1 . For every pair (i, j) , check if nums[i] + nums[j] == target . If condition becomes true: Allocate memory for 2 integers using malloc() . Store indices i and j . Set returnSize = 2 . Return the result poi...
Post a Comment
Read more
Labels

Top 5 Examples of volatile in C

Top 5 Examples of volatile in C

// Example 1: GPIO Register
#define GPIO_PORT (*(volatile unsigned int*)0x40021000)
while ((GPIO_PORT & 0x01) == 0) { }

// Example 2: Interrupt Flag
volatile int interrupt_flag = 0;
void ISR() { interrupt_flag = 1; }

// Example 3: Watchdog Reset
volatile int system_reset = 0;
while (!system_reset) { }

// Example 4: Multi-thread Flag
volatile int data_ready = 0;
while (!data_ready) { }

// Example 5: Sensor Polling
#define SENSOR_STATUS_REG (*(volatile unsigned char*)0x40024000)
while ((SENSOR_STATUS_REG & 0x01) == 0) { }

Use volatile whenever a variable might change unexpectedly due to hardware, interrupts, or concurrency. This prevents compiler optimizations that can cause bugs in real-time systems.

Labels:

Comments

Post a Comment

Popular Posts

🌙