Skip to main content

Write a program in C++ to enter marks of 10 students using array. Sort array elements in ascending and descending order using pointer.

 Here's a program in C++ that allows you to enter marks of 10 students using an array, and then sorts the array in ascending and descending order using pointers.

#include <iostream>
using namespace std;
// Function to sort an array in ascending order
void sortAscending(int *arr, int size) {
    for (int i = 0; i < size - 1; i++) {
        for (int j = i + 1; j < size; j++) {
            if (*(arr + j) < *(arr + i)) {

                // Swap the elements using pointer notation
                int temp = *(arr + i);
                *(arr + i) = *(arr + j);
                *(arr + j) = temp;
            }
        }
    }
}

// Function to sort an array in descending order
void sortDescending(int *arr, int size) {
    for (int i = 0; i < size - 1; i++) {
        for (int j = i + 1; j < size; j++) {
            if (*(arr + j) > *(arr + i)) {

                // Swap the elements using pointer notation
                int temp = *(arr + i);
                *(arr + i) = *(arr + j);
                *(arr + j) = temp;
            }
        }
    }
}

int main() {
    const int size = 10;
    int marks[size]; 

    // Input marks of 10 students using pointer notation
    cout << "Enter the marks of 10 students:" << endl;
    for (int i = 0; i < size; i++) {
        cin >> *(marks + i);
    }

    // Print out the original array using pointer notation
    cout << "Original array: ";
    for (int i = 0; i < size; i++) {
        cout << *(marks + i) << " ";
    }
    cout << endl;

    // Sort the array in ascending order using pointer notation
    sortAscending(marks, size);
    cout << "Sorted array in ascending order: ";
    for (int i = 0; i < size; i++) {
        cout << *(marks + i) << " ";
    }
    cout << endl;

    // Sort the array in descending order using pointer notation
    sortDescending(marks, size);
    cout << "Sorted array in descending order: ";
    for (int i = 0; i < size; i++) {
        cout << *(marks + i) << " ";
    }
    cout << endl;
    return 0;
}

In this program, we first declare an integer array marks of size 10, which will be used to store the marks of 10 students.

We then use a for loop to input the marks of the students into the marks array using pointer notation.

After that, we define two functions sortAscending and sortDescending, which take in an integer array 'arr' and its size size, and use nested loops to sort the array in ascending and descending order, respectively. Note that in these functions, we are using pointer notation to access the array elements.

Finally, we call these functions with the marks array and its size as arguments, and print out the original and sorted arrays using pointer notation to verify the correctness of the sorting algorithms.

Comments

Popular posts from this blog

Write a program using the algorithm count() to count how many elements in a container have a specified value.

 Here's an example program using the count() algorithm to count the number of occurrences of a specific value in a vector container: #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() {     vector<int> numbers = { 2, 5, 3, 7, 8, 5, 1, 5, 4 };          // count the number of occurrences of the value 5 in the vector     int count = count(numbers.begin(), numbers.end(), 5);          cout << "The number of occurrences of 5 in the vector is: " << count << endl;          return 0; } Output: The number of occurrences of 5 in the vector is: 3 Explanation: The program starts by creating a vector named numbers that contains several integer values. The count() algorithm is used to count the number of occurrences of the value 5 in the numbers vector. The function takes three arguments: the beginning and end iterators of...

What are Stub and Skeleton in Distributed Application? Explain its function with block diagram.

 Stub and Skeleton are two important components of distributed applications. A distributed application is a software system that runs on multiple computers connected through a network. It allows users to access resources and services on different computers as if they were on a local computer. In a distributed application, a client program on one computer sends a request to a server program on another computer. The server program processes the request and sends a response back to the client program. Stub and Skeleton help to facilitate this communication between the client and server programs. A Stub is a client-side proxy that represents the remote object on the client machine. It acts as a gateway for the client to communicate with the server. When a client invokes a method on the Stub, it marshals the arguments and sends them to the server over the network. The Stub then waits for the server to send a response. When the response is received, the Stub unmarshals the data and retur...

Explain the lifecycle of Servlet with block diagram.

 The lifecycle of a Servlet can be divided into several stages. Here's a block diagram that illustrates the different stages: Servlet API: The Servlet API provides a standard set of interfaces and classes for creating and interacting with Servlets. It is typically included in the web application's classpath as a JAR file. Servlet Container: The Servlet Container is a web server or application server that implements the Servlet API. It provides a runtime environment for executing Servlets and manages their lifecycle. Servlet Class: The Servlet Class is the Java class that implements the javax.servlet.Servlet interface. It contains the logic for processing HTTP requests and generating HTTP responses. init(): The init() method is called once when the Servlet is first loaded by the Servlet Container. It is used for initialization tasks, such as setting up database connections, loading configuration settings, or initializing other resources that will be used by the Servlet. service(...