Publish your website for free | fastest and quickest way

-

Comments

Post a Comment

Popular posts from this blog

priority_queue

-
  #include <iostream> #include <queue> #include <vector> using namespace std ; int main (){     // priority_queue<int> q;     // priority_queue<int, vector<int>, greater<int>> q;     auto cmp = []( int a , int b ){         return a < b ;     };     priority_queue < int , vector < int > , decltype (cmp) > q(cmp);         vector < int > v = { 8 , 1 , 6 , 4 , 0 , 7 , 2 , 9 };     for ( int x: v) q. push (x);     while ( ! q. empty ()){         cout << q. top () << " " ;         q. pop ();     }     cout << endl ;     return 0 ; }
Read more

Alignment in css

-
  <! DOCTYPE   html > < html   lang = "en" > < head >      < meta   charset = "UTF-8" >      < meta   http-equiv = "X-UA-Compatible"   content = "IE=edge" >      < meta   name = "viewport"   content = "width=device-width, initial-scale=1.0" >      < title > Alignment </ title >      < link   rel = "preconnect"   href = "https://fonts.gstatic.com" >      < link   href = "https://fonts.googleapis.com/css2?family=Ubuntu:wght@300&display=swap"   rel = "stylesheet" >      < style >          *  {              box-sizing :  border-box ;         }          body  {              font-family :  'Ubuntu' ,  sans-serif ;         }          .container  {              width :  900px ;              border :  3px   solid   purple ;              margin :  33px   auto ;              background-color :  rgb ( 248 ,  191 ,  141 );
Read more

Queue data structure in c++

-
  #include <iostream> using namespace std ; #define n 10 class queue {     int * arr;     int front;     int back;     public:       queue (){          arr = new int [ n ];          front =- 1 ;          back =- 1 ;      }       void push ( int x ){           if (back == n - 1 ){              cout << "queue is not empty " << endl ;               return ;          }          back ++ ;          arr[back] = x ;           if (front ==- 1 ){              front ++ ;          }      }       void pop (){           if (front > back || front ==- 1 ){              cout << "no element is in the queue " << endl ;               return ;          }          front ++ ;      }       int peek (){           if (front > back || front ==- 1 ){              cout << "no element in the queue" << endl ;               return - 1 ;          }           return arr[front];      }       bool empty (){           if (front &
Read more