SORTING PROGRAM

 #include <iostream>

using namespace std;


int main() {

    int n[5], i, num_elements;


    cout << "Enter the number of elements (up to 3): ";

    cin >> num_elements;


    if (num_elements > 3) {

        cout << "Number of elements exceeds the limit of 3." << end;

        return 1;

    }


    cout << "Enter " << num_elements << " elements:" << endl;

    for (i = 0; i < num_elements; i++) {

        cin >> n[i];

    }


    int temp, j;

    for (i = 1; i < num_elements; i++) {

        j = i;

        while (j > 0 && n[j] < n[j - 1]) {

            temp = n[j];

            n[j] = n[j - 1];

            n[j - 1] = temp;

            j--;

        }

    }


    cout << "Sorted elements: ";

    for (i = 0; i < num_elements; i++) {

        cout << n[i] << " ";

    }

    cout << endl;


    return 0;

}


Comments

Post a Comment

Popular posts from this blog

LIST ADT USING LINKED LIST

 #include <iostream> using namespace std; struct Node {     int data;     Node* next; }; Node* head = nullptr; void insert() {     int value;     cout << "\nEnter the element to insert: ";     cin >> value;     Node* newNode = new Node{value, nullptr};     if (!head) {         head = newNode;     } else {         newNode->next = head;         head = newNode;     } } void display() {     if (!head) {         cout << "\nList is empty\n";         return;     }     Node* temp = head;     cout << "\nList elements:\n";     while (temp) {         cout << temp->data << " ";         temp = temp->next;     }     cout << "\n"; } int main() { ...
Read more

CLASSES CREATION

  #include <iostream> using namespace std; class sample   //class creation { public: static int a; // datatype static void data() { cout<<"i am the best"; } //function }; int sample::a=10; //declaring datatype int main() { cout<<sample::a<<"\n";    //printing data sample::data();    //printing function without return type return 0; }
Read more