optimized bubble sort


#include <iostream>

#include <vector>


using namespace std;


int main()

{

    vector<int> vec = {10,20,30};

    

    //booble sort

    bool  check = false;

    

    for(int i = 0; i<= vec.size(); i++)

    {

         

        for (int j= i+1; j<vec.size(); j++)

        {

            

            if(vec[j] < vec[i])

            {

                int temp = vec[i];

                vec[i] = vec[j];

                vec[j] = temp;

                check = true;

            }

            

        }

        

        if(!check)

        {

            cout << "vector is alreday sorted" <<endl;

            break;

        }

    }

    

    for(int x : vec)

    {

        cout << x << endl;

    }


    return 0;

}

0(n) - complexity  for sorted data 

Comments

Post a Comment

Popular posts from this blog

Implementation of Queue using Array

 _________________________Main.cpp_____________________________________ #include"OwnQueue.h" int main() {     std::cout << "MY.. QUEUE!\n" << endl;     OwnQueue queue;     queue.dequeue();     queue.enqueue(10);     queue.enqueue(20);     queue.enqueue(0);     queue.enqueue(40);     cout << queue.peek() << endl;     queue.enqueue(50);     queue.enqueue(70);     cout << queue.isempty() << endl;     cout << queue.isfull() << endl;     queue.dequeue();     queue.dequeue();     queue.dequeue();     queue.dequeue();     cout << queue.peek() << endl;     queue.dequeue();     queue.dequeue();     cout << queue.isempty() << endl;     cout << queue.isfull() << endl;      queue.printqueue...
Read more

Printing the odd and even no using Pthread

#include<iostream> #include <pthread.h> using namespace std; void *even(void * size) {             int x = reinterpret_cast<int> (size);         cout << "even no" <<endl;     for(int i = 0; i<x; i++)     {         if(i%2 == 0){                         cout << i << endl;         }             }     cout <<endl;     cout <<"even thread is terminited ";     cout <<endl; } void *odd(void *size ) {     pthread_t tid2;         int x = reinterpret_cast<int> (size);         cout << "odd no" <<endl ; ...
Read more

Print even and odd using two thread in synchronized way

 Print even and odd using two thread in synchronized way : Example :  ODD Thread will print  1                    EVEN Thread will print  2                  ----------------------------------------------                   ODD Thread will print till pre-define range                   EVEN Thread will print till pre-define range Solutions : #include <iostream> #include <thread> #include <mutex> #include <condition_variable> #define MAXSIZE 1000 using namespace std; mutex mu; condition_variable con; int mycount = 1; void printodd() {        cout << "i am in ODD thread" << endl;                 while (mycount < MAXSIZE) {         unique_lock<mutex> mylock(mu); ...
Read more