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...

Student Records Using Structure Array in C

Student Records Using Structure Array in C

✅ Student Records Using Structure Array in C

#include <stdio.h>

struct student {
    char name[50];
    int roll;
    float marks;
};

int main() {
    int n;
    printf("Enter number of students: ");
    scanf("%d", &n);

    struct student s[n];  // Array of structs

    // Input Section
    for(int i = 0; i < n; i++) {
        printf("\n=== ENTER DETAILS OF STUDENT %d ===\n", i + 1);
        printf("Name: ");
        scanf(" %[^\n]", s[i].name);  // Accepts spaces

        printf("Roll Number: ");
        scanf("%d", &s[i].roll);

        printf("Marks: ");
        scanf("%f", &s[i].marks);
    }

    // Output Section
    printf("\n=== STUDENT DETAILS ===\n");
    for(int i = 0; i < n; i++) {
        printf("\nStudent %d\n", i + 1);
        printf("Name       : %s\n", s[i].name);
        printf("Roll Number: %d\n", s[i].roll);
        printf("Marks      : %.2f\n", s[i].marks);
    }

    return 0;
}
  

๐Ÿ“˜ Explanation:

This C program uses an array of structures to store details of multiple students. The structure student has fields for name, roll number, and marks. The program prompts the user for the number of students, then collects their data using a loop, and finally prints all the stored data. Useful in managing records in a structured format.

๐Ÿงพ Sample Output:

Enter number of students: 2

=== ENTER DETAILS OF STUDENT 1 ===
Name: Naveen Kumar
Roll Number: 101
Marks: 85.5

=== ENTER DETAILS OF STUDENT 2 ===
Name: Ravi Teja
Roll Number: 102
Marks: 91

=== STUDENT DETAILS ===

Student 1
Name       : Naveen Kumar
Roll Number: 101
Marks      : 85.50

Student 2
Name       : Ravi Teja
Roll Number: 102
Marks      : 91.00
  

๐Ÿ”‘ Keywords:

Structure Array in C, C Student Record Program, Array of Structures, Student Information Storage in C, struct keyword in C, C Programming for Beginners

๐Ÿ“Œ Hashtags:

#CProgramming #StructuresInC #StudentRecord #ArrayOfStructures #BeginnerCProgram #CollegeAssignment #LearnCProgramming

Comments

Popular Posts

๐ŸŒ™