Ko‘rsatkichlar va dinamik xotira
Do‘stingizga kitobni berasizmi yoki kitob turgan javon manzilini?
Katta narsani nusxalash qimmat — manzilni aytish esa arzon.
Bu ma’ruza oxirida siz quyidagilarni bajara olasiz...
Ko‘rsatkich tushunchasi
Qiymat emas — manzil saqlaydigan o‘zgaruvchi
&x — manzil olish
int *p = &x;*p — murojaat
cout << *p;, *p = 20;nullptr
int *q = nullptr;* ikki ma’noda: e’londa (int *p) — “bu ko‘rsatkich”, ifodada (*p = 20) — “ko‘rsatilgan joydagi qiymat”.Ko‘rsatkich orqali o‘zgartirish
int x = 10; int *p = &x; cout << "x = " << x << ", *p = " << *p << endl; *p = 25; cout << "x = " << x << endl; cout << (p == &x) << endl; cout << "sizeof(p) = " << sizeof(p);
x = 10, *p = 10 x = 25 1 sizeof(p) = 8
nullptr va turli turdagi ko‘rsatkichlar
int a = 5, b = 8; double d = 3.14; int *p = nullptr; if (p == nullptr) cout << "bo'sh" << endl; p = &a; cout << *p << endl; p = &b; *p += 10; cout << b << endl; double *pd = &d; cout << *pd;
bo'sh 5 18 3.14
int* faqat int ni ko‘rsatadi1-bo‘lim yakuni: Ko‘rsatkich tushunchasi
int x = 10; int *p = &x; *p = 20; dan keyin x = ?& va * operatorlarining vazifasi nima?1-topshiriq: Ko‘rsatkich orqali almashtirish
void almashtir(int* a, int* b) funksiyasini yozing: u ko‘rsatkichlar orqali ikki o‘zgaruvchining qiymatlarini almashtirsin. main() tayyor: ikki son o‘qiydi, funksiyani chaqiradi va natijani chiqaradi.
Kirish: Ikki butun son x va y.
Chiqish: Almashtirilgandan keyingi x y — bitta qatorda.
3 8
8 3
Ko‘rsatkich arifmetikasi
Ko‘rsatkich elementlar bo‘yicha siljiydi
| Ifoda | Ma’nosi |
|---|---|
p + i | i-elementning manzili (&a[i]) |
*(p + i) | i-element qiymati — a[i] bilan aynan bir xil |
p++, p-- | Keyingi / oldingi elementga o‘tish |
q - p | Ikki ko‘rsatkich orasidagi elementlar soni |
p < q | Solishtirish (bitta massiv ichida) |
p + 1 manzilni 1 baytga emas, sizeof(tur) baytga oshiradi: int* — 4, double* — 8, char* — 1.Massivni ko‘rsatkich bilan aylanib chiqish
int a[5] = {10, 20, 30, 40, 50}; int *p = a; cout << *(p + 2) << " " << p[3] << endl; for (int *q = a; q < a + 5; q++) cout << *q << " "; cout << endl; int *oxir = &a[4]; cout << oxir - p << " ta element oraliq";
30 40 10 20 30 40 50 4 ta element oraliq
Massivni joyida teskari aylantirish
int a[] = {4, 17, 9, 23, 5}; int *chap = a, *ong = a + 4; while (chap < ong) { int t = *chap; *chap = *ong; *ong = t; chap++; ong--; } for (int x : a) cout << x << " ";
5 23 9 17 4
2-bo‘lim yakuni: Ko‘rsatkich arifmetikasi
int a[5]; int *p = a; bo‘lsa *(p + 3) nima?*p + 1 va *(p + 1) farqi?2-topshiriq: Ko‘rsatkich bilan yurish
long long yigindi(const int* bosh, const int* oxir) funksiyasini yozing: u [bosh, oxir) oralig‘idagi elementlar yig‘indisini indekssiz, faqat ko‘rsatkichni oshirib hisoblasin. main() butun massiv va uning ikkinchi yarmi uchun chaqiradi.
Kirish: Birinchi qatorda n (1 ≤ n ≤ 1000), ikkinchi qatorda n ta butun son (|son| ≤ 10⁹).
Chiqish: Ikki qator: barcha elementlar yig‘indisi va a + n/2 dan oxirigacha bo‘lgan elementlar yig‘indisi.
4 1 2 3 4
10 7
Havolalar va funksiyalar
Funksiya asl o‘zgaruvchini o‘zgartira oladimi?
| Usul | E’lon | Chaqiruv | Asl o‘zgaradimi? |
|---|---|---|---|
| Qiymat bo‘yicha | void f(int x) | f(a) | Yo‘q — nusxa |
| Ko‘rsatkich orqali | void f(int *x) | f(&a) | Ha, *x orqali |
| Havola orqali | void f(int &x) | f(a) | Ha, x — a ning taxallusi |
int &r = a;) — mavjud o‘zgaruvchining ikkinchi nomi. U nullptr bo‘lolmaydi va boshqa o‘zgaruvchiga qayta bog‘lanmaydi.Qaysi biri haqiqatan almashtiradi?
void s1(int x, int y) { int t = x; x = y; y = t; } void s2(int *x, int *y) { int t = *x; *x = *y; *y = t; } void s3(int &x, int &y) { int t = x; x = y; y = t; } int main() { int a = 5, b = 9; s1(a, b); cout << a << b << " "; s2(&a, &b); cout << a << b << " "; s3(a, b); cout << a << b; }
59 95 59
Nimani o‘zgartirish mumkin emas?
const qayerda turibdi?
const int *p— qiymat o‘zgarmas:*p = 5✗,p = &y✓int *const p— ko‘rsatkich o‘zgarmas:*p = 5✓,p = &y✗const int *const p— ikkalasi ham o‘zgarmas
Ko‘rsatkichga ko‘rsatkich
int **pp = &p;— ko‘rsatkichning manzili**pp = 100;— ikki marta murojaat, oxirgi qiymatga- Ikki o‘lchovli dinamik massivda kerak (5-bo‘lim)
const o‘zidan chapdagi narsaga (chapda hech narsa bo‘lmasa — o‘ngdagiga) tegishli.3-bo‘lim yakuni: Havolalar va funksiyalar
swap(int, int) yoki swap(int*, int*)?const int *p da nimani o‘zgartirib bo‘lmaydi?3-topshiriq: Havola orqali min va max
void minmax(const int* a, int n, int& mn, int& mx) funksiyasini yozing: u massivning eng kichik va eng katta elementini havola (&) parametrlar orqali qaytarsin.
Kirish: Birinchi qatorda n (1 ≤ n ≤ 1000), ikkinchi qatorda n ta butun son.
Chiqish: Bitta qatorda: minimum va maksimum.
5 3 -1 8 0 8
-1 8
Dinamik xotira: new va delete
Xotiraning ikki hududi
| Stek (stack) | Uyum (heap) | |
|---|---|---|
| Ajratish | Avtomatik, e’lon qilinganda | Qo‘lda, new orqali |
| Bo‘shatish | Avtomatik, blok tugaganda | Qo‘lda, delete orqali |
| Hajmi | Kichik (1–8 MB) | Katta (operativ xotira hajmicha) |
| O‘lcham | Kompilyatsiya vaqtida ma’lum | Ishlash vaqtida aniqlanadi |
new ga bitta delete, har bir new[] ga bitta delete[]. Bo‘shatilmagan xotira — xotira sizishi (memory leak).Bitta obyekt va massiv
int *p = new int; // qiymati noaniq int *q = new int(42); // 42 bilan int *r = new int[5]{1, 2, 3, 4, 5}; *p = 7; cout << *p << " " << *q << endl; for (int i = 0; i < 5; i++) cout << r[i]; delete p; delete q; delete[] r; p = q = r = nullptr;
7 42 12345
[] bilanO‘lcham faqat ishlash vaqtida ma’lum
int n; cin >> n; double *baho = new double[n]; double sum = 0; for (int i = 0; i < n; i++) { cin >> baho[i]; sum += baho[i]; } cout << "O'rtacha: " << sum / n; delete[] baho; baho = nullptr;
O'rtacha: 80.75
4-bo‘lim yakuni: Dinamik xotira: new va delete
int *p = new int[n]; qanday bo‘shatiladi?Dinamik massivlar
Joy yetmasa — kattaroq blokka ko‘chish
Yangi blok
int *b = new int[cap * 2];Nusxalash
for (i < size) b[i] = a[i];Eskisini bo‘shatish
delete[] a;Ko‘rsatkichni yangilash
a = b; cap *= 2;vector ham aynan shunday ishlaydi.0 kiritilguncha kengayuvchi massiv
int cap = 2, size = 0, x; int *a = new int[cap]; while (cin >> x && x != 0) { if (size == cap) { int *b = new int[cap * 2]; for (int i = 0; i < size; i++) b[i] = a[i]; delete[] a; a = b; cap *= 2; cout << "[cap=" << cap << "] "; } a[size++] = x; } cout << size << " ta element"; delete[] a;
[cap=4] [cap=8] 5 ta element
Ko‘rsatkichlar massivi: int **m
int n = 2, k = 3; int **m = new int*[n]; for (int i = 0; i < n; i++) m[i] = new int[k]; for (int i = 0; i < n; i++) for (int j = 0; j < k; j++) m[i][j] = i * 10 + j; cout << m[1][2] << endl; for (int i = 0; i < n; i++) delete[] m[i]; delete[] m;
12
5-bo‘lim yakuni: Dinamik massivlar
int **m matritsa qanday tartibda bo‘shatiladi?4-topshiriq: Dinamik massiv: prefiks yig‘indilar
n ta son berilgan, n oldindan noma’lum (10⁵ gacha). new bilan dinamik massiv yarating, sonlarni o‘qing va ikkinchi dinamik massivda prefiks yig‘indilarni hisoblang: p[i] = a[0] + … + a[i]. Oxirida delete[] bilan xotirani bo‘shating.
Kirish: Birinchi qatorda n (1 ≤ n ≤ 100000), ikkinchi qatorda n ta butun son (|son| ≤ 10⁹).
Chiqish: Bitta qatorda n ta prefiks yig‘indi.
5 1 2 3 4 5
1 3 6 10 15
Xotira xatolari va aqlli ko‘rsatkichlar
Kompilyator ko‘pincha sezmaydigan xatolar
1Xotira sizishi
2Osilib qolgan ko‘rsatkich
3Ikki marta delete
4new[] / delete
delete bilan bo‘shatiladi — noto‘g‘ri.5nullptr ga murojaat
*p, bunda p == nullptr — “Segmentation fault”.6Yechim
vector — xotira o‘zi bo‘shaydi.unique_ptr va shared_ptr
#include <iostream> #include <memory> using namespace std; int main() { unique_ptr<int> u = make_unique<int>(10); unique_ptr<int> u2 = move(u); cout << (u ? "bor" : "bo'sh") << " " << *u2 << endl; shared_ptr<int> s1 = make_shared<int>(99); { shared_ptr<int> s2 = s1; cout << s1.use_count() << " "; } cout << s1.use_count(); return 0; }
bo'sh 10 2 1
move()use_count() hisoblagichiEng xavfsiz dinamik massiv
#include <iostream> #include <vector> using namespace std; int main() { vector<int> v; for (int x : {3, 1, 4, 1, 5}) v.push_back(x); v.pop_back(); int s = 0; for (int x : v) s += x; cout << v.size() << " " << s; return 0; }
4 9
6-bo‘lim yakuni: Xotira xatolari va aqlli ko‘rsatkichlar
Asosiy xulosalar
1Ko‘rsatkich
int *p = &x;, qiymat — *p.2Massiv = manzil
a[i] ≡ *(a + i); p + 1 — keyingi element.3Uzatish
int &x).4new / delete
new[] ↔ delete[]; bo‘shatilmasa — xotira sizishi.5Dinamik massiv
6Aqlli ko‘rsatkichlar
unique_ptr, shared_ptr, vector — xotira o‘zi bo‘shaydi.Yakunlashdan oldin sakkizta savol
int *p = &x; da p nimani saqlaydi?*p = 5; nima qiladi?a[2] ni ko‘rsatkich bilan qanday yozasiz?new int[10] ni bo‘shatish?vector ga element qo‘shish metodi?7-laboratoriya ishi: 6 ta dasturlash topshirig‘i
O‘suvchi massiv
Ikki ko‘rsatkich: teskari so‘z
Matritsani burish
Elementni o‘chirish
Saralangan massivlarni birlashtirish
Ko‘phadlar ko‘paytmasi
Darsni tark etishdan oldin
Javoblaringizni yozing (✎ Javob yozish) yoki qog‘ozga yozib topshiring.
int a = 3; int *p = &a; *p *= 4; dan keyin a nechaga teng?