#include <iostream>
#include<deque>
using namespace std;

int main()
{
deque <int> navbat1,navbat;
int n;
cout<<"n= "; cin>>n;
cout<<"navbat elementlarini kiriting: ";
for(int i=0;i<n;i++)
{ int k;
cin>>k;
navbat.push_back(k);
}
int k=0;
int min=navbat.front();
for(int i:navbat)
{ if(i<min)min=i;
}
for(int i:navbat)
{ navbat1.push_back(i);
if(i==min) navbat1.push_back(0);

k++;
navbat.pop_front();
}

cout<<"\n navbatni minimal elementidan keyingi o'rniga 0 joylashtirilsin: ";
for(int j:navbat1)
{
cout<<j<<" ";
}

return 0;
}

/*
Ikki ro'yhat birlashtirilsin

*/


#include <bits/stdc++.h>
using namespace std;
int main()
{
list<int> list1,list2;
int n,m;
cout<<"1- list elementlari soni: "; cin>>n;
cout<<"1- list elementlarini kiriting: ";
for(int i=0;i<n;i++)
{ int k;
cin>>k;
list1.push_back(k);
}
cout<<"2- list elementlari soni: "; cin>>m;
cout<<"2- list elementlarini kiriting: ";
for(int i=0;i<m;i++)
{ int k;
cin>>k;
list2.push_back(k);
}

list2.merge(list1);
cout << "List: ";
for (auto i = list2.begin(); i != list2.end(); ++i)
cout << *i << " ";
return 0;
}

#include<bits/stdc++.h>
using namespace std;
struct KOMPUTER
{
int id;
string nomi;
string YILI;
string XOTIRASI;
};

int main()
{ int n,k,d;
KOMPUTER a[10];
deque<int> myDeque;
a[0].id=1; a[0].nomi= "HP "; a[0].XOTIRASI="1024 GB"; a[0].YILI="2012";
a[1].id=2; a[1].nomi= "ACER "; a[1].XOTIRASI="1024 GB"; a[1].YILI="2015";
a[2].id=3; a[2].nomi= "SAMSUNG "; a[2].XOTIRASI="512 GB"; a[2].YILI="2018";
a[3].id=4; a[3].nomi= "LG "; a[3].XOTIRASI="2048 GB"; a[3].YILI="2019";
a[4].id=5; a[4].nomi= "TOSHIBA "; a[4].XOTIRASI="1024 GB"; a[4].YILI="2019";
a[5].id=6; a[5].nomi= "APPLE "; a[5].XOTIRASI="1024 GB"; a[5].YILI="2016";
a[6].id=7; a[6].nomi= "SAMSUNG "; a[6].XOTIRASI="512 GB"; a[6].YILI="2014";
a[7].id=8; a[7].nomi= "AVTECH "; a[7].XOTIRASI="1024 GB"; a[7].YILI="1996";
a[8].id=9; a[8].nomi= "LINUX "; a[8].XOTIRASI="1024 GB"; a[8].YILI="2000";
a[9].id=10; a[9].nomi="ASUS "; a[9].XOTIRASI="512 GB"; a[9].YILI="2017";
for(int i=0;i<10;i++)
{
for(int j=0;j<10;j++)
{
if(i!=j && a[i].nomi==a[j].nomi) myDeque.push_back(i);
}
}



cout<<endl<<"Tr"<<"\t"<<"id:"<<"\t"<<"Nomi:""\t"<<" YILI:"<<"\t"<<" XOTIRASI:"<<endl;
for (int i=0;i<10; i++)
{
cout<<i+1<<"\t"<<a[i].id<<"\t"<<a[i].nomi<<"\t\t"<<a[i].YILI<<"\t\t"<<a[i].XOTIRASI<<endl;
}
cout<<"\n Navbat orqali bir xil nomli KOMPUTERLARni ekranga chiqarildi: ";
cout<<endl<<"Tr"<<"\t"<<"id:"<<"\t"<<"Nomi:""\t"<<" YILI:"<<"\t"<<" XOTIRASI:"<<endl;
for(int i = 0; i < myDeque.size(); i++) {
cout<<i+1<<"\t"<<a[ myDeque[i]].id<<"\t"<<a[ myDeque[i]].nomi<<"\t\t"<<a[ myDeque[i]].YILI<<"\t\t"<<a[ myDeque[i]].XOTIRASI<<endl;
}

return 0;
}

1. Python Boshlang'ich - Tanishuv
@uz_python
Buni albatta kòrib chiqing va albatta siz eng zõr dasturlash tilini õrganishni boshlang !!!

Ma'lumot tuzilmalari (Data Structures) - Kirish
👇👇👇👇👇👇👇👇👇👇👇
@uz_python

#Stekning juft o‘rinda turgan elementlari o‘chirilsin.
stack=[]
n=int(input("stack nechta elemntdan iborat: "))
for i in range (0, n):
a=input("stack elemntlarini kiriting: ")

stack.append(a)
j=0
for i in stack:
if j:
stack.pop(j)
j+=1
print(stack)

Ma'lumot tuzilmalari (Data Structures) - List va Array haqida
👇👇👇👇👇👇
@uz_python

Ma'lumot tuzilmalari (Data Structures) - Bog'langan ro'yhat (Linked List)

👇👇👇👇👇👇
@uz_python

Ma'lumot tuzilmalari (Data Structures) - Stack
👇👇👇👇👇👇
@uz_python

Ma'lumot tuzilmalari (Data Structures) - Queue
👇👇👇👇👇👇
@uz_python

Ma'lumot tuzilmalari (Data Structures) - Tree
👇👇👇👇👇👇
@uz_python

Ma'lumot tuzilmalari (Data Structures) - Binary Tree

👇👇👇👇👇👇
@uz_python

Malumotlar Tuzilmasidan siz uchun kerakli bo'lgan videokurslar

@uz_python 💯💯💯

Ma'lumot tuzilmalari (Data Structures) - Kirish

https://t.iss.one/uz_python/191

Ma'lumot tuzilmalari (Data Structures) - List va Array haqida

https://t.iss.one/uz_python/193

Ma'lumot tuzilmalari (Data Structures) - Bog'langan ro'yhat (Linked List)

https://t.iss.one/uz_python/194

Ma'lumot tuzilmalari (Data Structures) - Stack

https://t.iss.one/uz_python/195

Ma'lumot tuzilmalari (Data Structures) - Queue

https://t.iss.one/uz_python/196

Ma'lumot tuzilmalari (Data Structures) - Tree

https://t.iss.one/uz_python/197

Ma'lumot tuzilmalari (Data Structures) - Binary Tree

https://t.iss.one/uz_python/198

@BekorchiStudentlar

Bitta dasturiy maxsulot davlatimizga qancha naf keltiradi, korrupsiya, byurokratiyani bartaraf etadi, Odamlarga qulaylik yaratadi.
Xar doyim yodda tutingki sizlarni ishingiz judayam muxim.
Credid: #ustoz_shogird
@uz_python

2 ta ro’yhatning bir xil qiymatli elementlaridan yangi halqasimon ro’yhat yarating

#include <iostream>
using namespace std;
class Node{
public: int number;
Node* next;
};
int main()
{ Node* head = NULL;
Node* lastPtr = NULL;
short action = -1;
while (1)
{ cout<<"1. 1- guruh raqam berish\n";
cout<<"2 2-guruh raqam berish:\n";
cout<<"3. ro'yhatni ko'rish\n";
cout<<"4 ro'yxatni korish\n";
cout<<" qushish\n";
cout<<"0. chiqish\n";
cout<<"tanlang: ";
cin>>action;
if (action == 0) {
system("CLS");
break;}
if (action == 1)
{ //system("CLS");
Node* ptr = new Node;
int numb = -1;

cout<<"son kiriting: ";
cin>>numb;
ptr->number = numb;
ptr->next = NULL;
if (head == 0)
{ head = ptr;
lastPtr = ptr;
// system("CLS");
continue;
}
lastPtr->next = ptr;
lastPtr = ptr;
//system("CLS");
continue;
}
if (action == 3){
Node* ptr = NULL;
//system("CLS");
if (head == 0)
{ cout<<"\t!!! ro'yhat bo'sh !!!\n\n";
system("PAUSE");
system("CLS");
continue;
}
cout<<"* * * * * ro'yhat * * * * *\n\n";
ptr = head;
while (1) {
cout<<ptr->number<<" ";
if (ptr->next == 0) break;

ptr = ptr->next;
}
cout<<"\n\n";
system("PAUSE");
//system("CLS");
continue;
}

if (action == 2)
{ //system("CLS");
Node* ken = new Node;
int numb = -1;

cout<<"son kiriting: ";
cin>>numb;
ken->number = numb;
ken->next = NULL;
if (head == 0)
{ head = ken;
lastPtr = ken;
// system("CLS");
continue;
}
lastPtr->next = ken;
lastPtr = ken;
system("CLS");
continue;
}
if (action == 4){
Node* ken = NULL;
//system("CLS");
if (head == 0)
{ cout<<"\t!!! ro'yhat bo'sh !!!\n\n";
system("PAUSE");
system("CLS");
continue;
}
cout<<"* * * * * ro'yhat * * * * *\n\n";
ken = head;
while (1) {
cout<<ken->number<<" ";
if (ken->next == 0) break;

ken = ken->next;
}
cout<<"\n\n";
system("PAUSE");
//system("CLS");
continue;
}
if(action==5)
{
Node* qush = NULL;
system("CLS");