|
- Dasturda jami bo‘lib, necha o‘zgartirish kiritildi
|
| bet | 12/12 | | Sana | 15.05.2024 | | Hajmi | 122,84 Kb. | | #234504 |
Bog'liq 3-mustaqil ish dasturlash Abduganiyev9- Dasturda jami bo‘lib, necha o‘zgartirish kiritildi:
Ushbu dasturda jami 10 ta o'zgartirish kiritilgan:
1. #include , #include , #include , #include kabi kutubxonalar ulandi.
2. using namespace std; qatori qo'shildi.
3. main() funksiyasi yaratildi.
4. Stek uchun myStack nomli o'zgaruvchi yaratildi.
5. myStack.push(10), myStack.push(20), myStack.push(30) kabi stek elementlarini qo'shish amallariga ega qatorlar yozildi.
6. Stek o'lchamini ko'rsatuvchi cout << "Stack size: " << myStack.size() << endl; qatori yozildi.
7. Stek uchun eng yuqorida turgan elementni ko'rsatuvchi cout << "Stack top: " << myStack.top() << endl; qatori yozildi.
8. Stek elementlarini o'chiruvchi myStack.pop(); qatori yozildi.
9. Vektor uchun myVector nomli o'zgaruvchi yaratildi.
10. Vektor uchun myVector.push_back(10), myVector.push_back(20), myVector.push_back(30) kabi elementlarni qo'shish amallariga ega qatorlar yozildi, myVector.erase(myVector.begin() + 1) qatori yozildi.
10- Shu dasturning analogini yaratish sizga mustaqil vazifadir:
#include
#include
#include
#include
#include
using namespace std;
int main() {
// Stack
stack myStack;
myStack.push(10);
myStack.push(20);
myStack.push(30);
cout << "Stack size: " << myStack.size() << endl;
cout << "Stack top: " << myStack.top() << endl;
myStack.pop();
cout << "Stack size after pop: " << myStack.size() << endl;
// Vector
vector myVector;
myVector.push_back(10);
myVector.push_back(20);
myVector.push_back(30);
cout << "Vector size: " << myVector.size() << endl;
cout << "Vector element at index 1: " << myVector[1] << endl;
myVector.erase(myVector.begin() + 1);
cout << "Vector size after erase: " << myVector.size() << endl;
// List
list myList;
myList.push_back(10);
myList.push_back(20);
myList.push_back(30);
cout << "List size: " << myList.size() << endl;
cout << "List element at index 1: " << *(next(myList.begin(), 1)) << endl;
myList.erase(next(myList.begin(), 1));
cout << "List size after erase: " << myList.size() << endl;
// Deque
deque myDeque;
myDeque.push_back(10);
myDeque.push_back(20);
myDeque.push_back(30);
cout << "Deque size: " << myDeque.size() << endl;
cout << "Deque element at index 1: " << myDeque[1] << endl;
myDeque.erase(myDeque.begin() + 1);
cout << "Deque size after erase: " << myDeque.size() << endl;
// Farqlar
cout << endl << "Farqlar:" << endl;
cout << "1. Stek LIFO (Last In First Out) tizimi, vektor va deque esa dinamik konteynerlari, list esa ikkilamchi bog'langan ro'yxatdir." << endl;
cout << "2. Stekda element qo'shish va o'chirish uchun push() va pop() funksiyalaridan foydalaniladi, vektor va deque uchun push_back() va erase() funksiyalaridan, list uchun esa push_back() va erase() funksiyalaridan foydalaniladi." << endl;
cout << "3. Stekdagi so'nggi element top() orqali olinadi, vektorda indeks orqali, listda esa iteratorlar orqali elementlar olinadi." << endl;
cout << "4. Stekda o'lchov size() funktsiyasi orqali olinadi, vektorlarda ham size() funksiyasi ishlatiladi, listlarda esa size() metodi qo'llaniladi." << endl;
cout << "5. Stek dinamik xotira talab qilmaydi, vektor va deque esa dinamik xotiradan foydalanadi, list esa xotiradan dinamik foydalanadi." << endl;
return 0;
}
Ushbu dastur stekka qo'shimcha ravishda list va deque konteynerlarini ham qo'shadi. Har bir konteynerdagi amallar va ularning o'ziga xos xususiyatlari ko'rsatiladi. Stek, vektor, list va deque orasidagi farqlar ham aniqlab berilgan.
|
| |
