Muhammad al-xorazmiy nomidagi axborot texnologiyalari universiteti

MUHAMMAD AL-XORAZMIY NOMIDAGI
AXBOROT TEXNOLOGIYALARI UNIVERSITETI


Infokommunikatsiya injiniringgi
2-bosqich 431-22-guruh talabasi
Ravshanov Adhamjonning
Ma‘lumotlar tuzilmasi va algoritmlar fanidan bajargan
mustaqil ishi


Topshirdi: Ravshanov Adhamjon
Toshkent 2023
1. Rekursiv misollarni tahlil qilish. Rekursiv
algoritmlarning dasturlarini ishlab chiqish.
Rekursiv funksiyalardan foydalangan holda dasturlarni ishlab
chiqing!


#include
using namespace std;

int main() {

string a[21][6];

for (int j = 0; j < 6; j++) {

for (int i = 0; i < 21; i++) {
a[i][j] = " ";
}
}

// A harfi

for (int i = 1; i <= 3; i++) {
for (int j = 0; j < 6; j++) {
if (i == 2 && j == 0 || (i >= 1 && i <= 3 && j == 3) || (i == 1 && j >= 1 && j <= 5) || (i == 3 && j >= 1 && j <= 5)) {
a[i][j] = "*";
}
}
}
// D harfi
for (int i = 5; i <= 7; i++) {
for (int j = 0; j < 6; j++) {
if (i == 5 || i == 6 && j == 0 || i == 6 && j == 5 || (j >= 1 && j <= 4 && i == 7)) {
a[i][j] = "*";
}
}
}

// H harfi

for (int i = 5; i <= 12; i++) {
for (int j = 0; j < 6; j++) {
if (i == 9 || i == 12 || (i == 10 && j == 3) || (i == 11 && j == 3)) {
a[i][j] = "*";
}
}
}

// A harfi

for (int i = 14; i <= 16; i++) {
for (int j = 0; j < 6; j++) {
if (i == 15 && j == 0 || (i >= 14 && i <= 16 && j == 3) || (i == 14 && j >= 1 && j <= 5) || (i == 16 && j >= 1 && j <= 5)) {
a[i][j] = "*";
}
}
}
// M harfi
for (int i = 17; i <= 21; i++) {
for (int j = 0; j < 6; j++) {
if ((i == 17 || i == 20) || (i == 19 && j == 2) || (i == 19 && j == 1) || (i == 18 && j >= 0 && j < 6)) {
a[i][j] = "*";
}
}
}

// Chizishni chiqarish

for (int j = 0; j < 6; j++) {
for (int i = 0; i < 21; i++) {
cout << a[i][j] << " ";
}
cout << endl;
}

return 0;

}
2. Kiritilgan sonlarni tub yoki tub emmaslikka tekshirish

#include

#include

using namespace std;

bool tubSonmi(int n, int i = 2) {
if (n <= 2) {
return (n == 2);
}
if (n % i == 0) {
return false;
}
if (i * i > n) {
return true;
}
return tubSonmi(n, i + 1);
}

int main() {

int son;
cout << "Bir son kiriting: ";
cin >> son;
if (son <= 1) {
cout << son << " tub emas." << endl;
} else {
if (tubSonmi(son)) {
cout << son << " tub son." << endl;
} else {
cout << son << " tub emas." << endl;
}
}
main();
return 0;
}

3. Foydalanuvchi tarafidan A, B va C satrlari kiritiladi (A>B, B>C). B satri A satrida joylashish o’rni va C satrning B satrda joylashish o’rni aniqlansin.



#include
#include
using namespace std;
int main() {
string A, B, C;

cout << "A satrini kiriting: ";
getline(cin, A);
cout << "B satrini kiriting: ";
getline(cin, B);
cout << "C satrini kiriting: ";
getline(cin, C);

size_t found_B_in_A = A.find(B);

if (found_B_in_A != string::npos) {
cout << "B satri A satrda " << found_B_in_A << " o'rinda joylashgan." << endl;
} else {
cout << "B satri A satrda joylashmagan." << std::endl;
}

size_t found_C_in_B = B.find(C);

if (found_C_in_B != string::npos) {
cout << "C satri B satrda " << found_C_in_B << " o'rinda joylashgan." << endl;
} else {
cout << "C satri B satrda joylashmagan." << endl;
}
main();

return 0;
}