Skip to main content

Featured

Merge Sort in C++

  Merge Sort in C++ Introduction Merge Sort is a popular sorting algorithm that follows the Divide and Conquer approach. It divides an array into smaller subarrays, recursively sorts those subarrays, and finally merges the sorted subarrays to produce a completely sorted array. In this tutorial, we will learn how to implement Merge Sort in C++ . The program divides the array into two halves using the mid index, recursively sorts both halves, and then combines them using the merge() function. Merge Sort has a time complexity of O(n log n) in the best, average, and worst cases. Table of Contents Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Keywords Conclusion Algorithm Start the program. Read the size of the array. Read the array elements from the user. Call the mer...

Octal to Hexadecimal Conversion in C

Octal to Hexadecimal Conversion in C

#include<stdio.h>

int main()
{
    int num;
    printf("Enter any octal number:\n");
    scanf("%o", &num);
    printf("Hexadecimal value is: %X\n", num);

    return 0;
}
  

๐Ÿ“˜ Explanation:

This C program converts an octal number into its hexadecimal equivalent using format specifiers.

  • The %o format specifier in scanf() reads an octal number.
  • The compiler internally converts the octal value into decimal.
  • The %X format specifier in printf() prints the value in hexadecimal (uppercase).
  • No manual conversion logic is required.

This is a simple and efficient way to convert octal to hexadecimal in C.

๐Ÿงพ Sample Output:

Enter any octal number:
17
Hexadecimal value is: F
  

๐Ÿ”‘ Keywords:

octal to hexadecimal in C, scanf format specifier, number system conversion, hex conversion in C, C programming basics

๐Ÿ“Œ Hashtags:

#CProgramming #OctalToHexadecimal #NumberSystem #CLanguage #CodingBasics #1printf

Comments

Popular Posts

๐ŸŒ™