Saturday, November 27, 2021

bubble sort

 #include<stdio.h>
int main() {
    int arr[5] = {44, 33, 55, 22, 11};
    int temp;
    
    for(int i = 0; i<=3; i++) {
        for(int j = 0; j<=3; j++ ) {
            if(arr[j] > arr[j + 1]) {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j+1] = temp;
            }
        }
    }
    
    for(int i = 0; i<=4; i++) {
        printf("%d", arr[i]);
    }
    return 0;
}

No comments:

Post a Comment

Priority queue deleting elements after ascending inputs Gaand Fadd

 using namespace std; #include<iostream> #define N 5 class pq { public:     int* arr;     int front;     int rear;     pq() {         ...