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

Define polymorphism. Differentiate between overloading and overriding method with example.

 Polymorphism is a concept in object-oriented programming that allows objects of different classes to be treated as if they were objects of the same class. It allows a single method or operation to have different meanings or behaviors based on the context in which it is used. In Java, there are two types of polymorphism: Compile-time Polymorphism: This is achieved through method overloading, where two or more methods in a class have the same name but different parameters. Runtime Polymorphism: This is achieved through method overriding, where a subclass provides its own implementation of a method that is already defined in its parent class. Here is an example of method overloading: class MyClass {    public int sum(int a, int b) {       return a + b;    }    public double sum(double a, double b) {       return a + b;    } } public class Main {    public static void main(String[] args) {     ...

write a program in C++ to overload '-' operator to find difference of two complex object.

write a program to overload '-' operator to find difference of two complex object /* program in C++ to overload '-' operator to find difference of two complex object */ #include<iostream> using namespace std; class Complex{     public:     float a, b;     complex(): a(0), b(0) {}     complex(float x, float y): a(x), b(y){}     void display(){          cout<<this->a<<"+"<<this->b<<"i"<<endl;     }     friend Complex operator-(const Complex&, const Complex&); }; complex operator-(const Complex& com, const Complex& comp){     float x= com.a - comp.a;     foat y= com.b - comp.b;     return Complex(x,y); } int main(){     Complex a(1,7), b(6,9);     cout<<"A = ";a.display();      cout<<"B = ";b.display();      cout<<"A - B = ";(a-b).display(); ...