#Algorithm_First
#Big_O_Notation
#Asimptotika
#Robocontes Eng Katta EKUB 2
#Useful

#Algorithm 02| Evklid algoritmi
#GCD
#Robocontes EKUB va EKUK
Aktivlikni oshirilar. Keyingi darslarda Robocontest 60% masala yechimi Binary Pow Va Evklid algoritmi bilan birgalikda ko'ramiz 😳😳😳

#Algorithm
Fikrlaringizni izohda qoldiring

#Algorithm
Oddiy vaksina(virusga qarshi dori) lardan tashkil topgan 1000 dona proberka bor. Afsuski ularning biriga 1-tomchi zahar tushib qoldi. Lekin qaysi biridaligi aniq emas. Bu zahar shunchalikham kuchliki agar u inson tanasiga tushsa uni tezda nobud qiladi. Labarotoriyada 10 ta sinov sichqonlari mavjud.
Zahar sinov sichqonlariga bir kunda ta'sir qiladi.
Zahar turgan proberkani aniqlash uchun labaratoriyaga eng kamida nechi kun kerak?
Fikrlaringizni izohlarda qoldiring.

#Algorithm
Marketda kechasi bilan quriqlab turishi kerak bo'lgan Posbonning bu gal omadi kelmadi. U o'zinining fonari(yoruglik tarqatuvchi) ni tekshirganda uning quvvati qolmaganini payqadi. Yaqinda TexnoMart aksiyasida u aksiyada 8 ta batareyka olgan edi. Lekin ularning yarmi yaroqli qolgan yarmi esa yaroqsiz. Fonar ishlashi uchun unga ikkita batareya quyish kerak. Endi Posbon kerakli batareyalarni topish uchun maksimal nechta batareyka juftligini ko'rishi kerak?
Fikrlaringizni izohlarda qoldiring

Sieve of Eratosthenes in C++: Spot the Errors and Improve the Code!
Here's an implementation of the "Sieve of Eratosthenes" algorithm in C++.
At first glance, the code seems functional, but it contains a few mistakes and areas for improvement. This is a great opportunity for you to practice your code review skills!

Task: Spot the issues in the code and suggest how it can be optimized or written more effectively. Share your thoughts in the comments!

Qo'yida sizga "Eratosfen g'alviri" nomli tub sonlarni maksimal tez aniqliydigan algoritm berilgan.

Algoritm goyasi kodda tuliq ifodanalangna lekin bazi bir kichik xatolar va kamchiliklar mavjud.
Bazi kamchiliklar til bilan boglangan bazilar esa yo'q
Xo'sh siz algoritmni dasturiy shaklni yanada optimal ko'rinishga keltirish uchun qanday fikr bera olasz?
Fikringizni izohlarda qoldiring.

#include <iostream>
#include <vector>

void sieveOfEratosthenes(int n) {
    std::vector<bool> primes(n); // Using a vector to store prime numbers
    for (int i = 0; i < n; i++) { 
        primes[i] = true; // Initialize all numbers as prime
    }
    
    primes[0] = primes[1] = false; // 0 and 1 are not prime numbers

    for (int p = 2; p < n; p++) { // Iterating up to n instead of sqrt(n)
        if (primes[p]) { // If the number is still marked as prime
            for (int i = p * p; i < n; i += p) { // Start marking multiples from p * p
                primes[i] = false; // Mark multiples as non-prime
            }
        }
    }

    // Print prime numbers
    std::cout << "Prime numbers up to " << n << ": ";
    for (int i = 2; i < n; i++) {
        if (primes[i]) {
            std::cout << i << " ";
        }
    }
    std::cout << std::endl;
}

int main() {
    int n = 50; // Fixed value for testing
    sieveOfEratosthenes(n);
    return 0;
}

#review
#algorithm