Tech Jargon - Decoded

前往频道在 Telegram

Confused by tech terms? Don’t worry, we’ve got you 🤝 We make things simple, one concept at a time. Learn daily Easy & clear Turn Confusion into clarity. #tech #it #softwareengineer #cs #development

显示更多

印度99 362 技术与应用31 069

2 015

订阅者

-124 小时

-57 天

-4030 天

135

帖子浏览量

无数据24 小时

无数据48 小时

6.69%

参与率

无数据

每日帖子数

Ads index

beta

帖子存档

2 015

Sieve of Eratosthenes

public class SieveOfEratosthenes {
    public static boolean[] sieve(int n) {
        boolean[] isPrime = new boolean[n + 1];
        for (int i = 2; i <= n; i++) {
            isPrime[i] = true;
        }

        for (int p = 2; p * p <= n; p++) {
            if (isPrime[p]) {
                for (int i = p * p; i <= n; i += p) {
                    isPrime[i] = false;
                }
            }
        }
        return isPrime;
    }

    public static void main(String[] args) {
        int n = 30;
        boolean[] prime = sieve(n);
        for (int i = 2; i <= n; i++) {
            if (prime[i]) {
                System.out.print(i + " ");
            }
        }
    }
}

2 015

primeNumbers sieveOfEratosthenes javaAlgorithm

2 015

Sieve of Eratosthenes

import java.util.Arrays;

public class SieveOfEratosthenes {

    public static boolean[] sieve(int n) {
        boolean[] isPrime = new boolean[n + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int p = 2; p * p <= n; p++) {
            if (isPrime[p]) {
                for (int i = p * p; i <= n; i += p) {
                    isPrime[i] = false;
                }
            }
        }
        return isPrime;
    }

    public static void main(String[] args) {
        int n = 30;
        boolean[] primeNumbers = sieve(n);
        System.out.println("Prime numbers up to " + n + ":");
        for (int i = 2; i <= n; i++) {
            if (primeNumbers[i]) {
                System.out.print(i + " ");
            }
        }
    }
}

2 015

#Java #Algorithm #PrimeNumbers

2 015

Sieve of Eratosthenes

public class SieveOfEratosthenes { public static boolean[] sieve(int n) { boolean[] isPrime = new boolean[n + 1]; for (int i = 2; i <= n; i++) { isPrime[i] = true; } for (int p = 2; p * p <= n; p++) { if (isPrime[p]) { for (int i = p * p; i <= n; i += p) { isPrime[i] = false; } } } return isPrime; } public static void main(String[] args) { int n = 30; boolean[] primes = sieve(n); for (int i = 2; i <= n; i++) { if (primes[i]) { System.out.print(i + " "); } } } }

2 015

#Java #PythagoreanTriplets #Arrays

2 015

Check Pythagorean Triplets

import java.util.Arrays;

public class PythagoreanTriplets {

    public static boolean isPythagoreanTriplet(int[] arr) {
        Arrays.sort(arr);
        int a = arr[0], b = arr[1], c = arr[2];
        return (a * a + b * b == c * c);
    }

    public static void main(String[] args) {
        int[] arr1 = {3, 1, 4};  
        int[] arr2 = {3, 4, 5};
        System.out.println("Is {3, 1, 4} a Pythagorean triplet? " + isPythagoreanTriplet(arr1));
        System.out.println("Is {3, 4, 5} a Pythagorean triplet? " + isPythagoreanTriplet(arr2));
    }
}

2 015

#Java #Algorithm #PrimeNumbers

2 015

Sieve of Eratosthenes

public class Sieve {
 public static boolean[] sieve(int n) {
 boolean[] isPrime = new boolean[n + 1];
 for (int i = 2; i <= n; i++) {
 isPrime[i] = true;
 }
 for (int p = 2; p * p <= n; p++) {
 if (isPrime[p]) {
 for (int i = p * p; i <= n; i += p) {
 isPrime[i] = false;
 }
 }
 }
 return isPrime;
 }

 public static void main(String[] args) {
 boolean[] primes = sieve(30);
 for (int i = 2; i < primes.length; i++) {
 if (primes[i]) {
 System.out.print(i + " ");
 }
 }
 System.out.println();
 }
}

2 015

#Java #Algorithm #PrimeNumbers

2 015

Sieve of Eratosthenes

public class Sieve {
 public static boolean[] sieve(int n) {
 boolean[] isPrime = new boolean[n + 1];
 for (int i = 2; i <= n; i++) {
 isPrime[i] = true;
 }
 for (int p = 2; p * p <= n; p++) {
 if (isPrime[p]) {
 for (int i = p * p; i <= n; i += p) {
 isPrime[i] = false;
 }
 }
 }
 return isPrime;
 }

 public static void main(String[] args) {
 boolean[] primes = sieve(30);
 for (int i = 2; i < primes.length; i++) {
 if (primes[i]) {
 System.out.print(i + " ");
 }
 }
 System.out.println();
 }
}

2 015

#Java #Algorithm #PrimeNumbers

2 015

Sieve of Eratosthenes

public class Sieve {
 public static boolean[] sieve(int n) {
 boolean[] isPrime = new boolean[n + 1];
 for (int i = 2; i <= n; i++) {
 isPrime[i] = true;
 }
 for (int p = 2; p * p <= n; p++) {
 if (isPrime[p]) {
 for (int i = p * p; i <= n; i += p) {
 isPrime[i] = false;
 }
 }
 }
 return isPrime;
 }

 public static void main(String[] args) {
 boolean[] primes = sieve(30);
 for (int i = 2; i < primes.length; i++) {
 if (primes[i]) {
 System.out.print(i + " ");
 }
 }
 System.out.println();
 }
}

2 015

#Java #Algorithm #PrimeNumbers

2 015

Sieve of Eratosthenes

public class Sieve {
 public static boolean[] sieve(int n) {
 boolean[] isPrime = new boolean[n + 1];
 for (int i = 2; i <= n; i++) {
 isPrime[i] = true;
 }
 for (int p = 2; p * p <= n; p++) {
 if (isPrime[p]) {
 for (int i = p * p; i <= n; i += p) {
 isPrime[i] = false;
 }
 }
 }
 return isPrime;
 }

 public static void main(String[] args) {
 boolean[] primes = sieve(30);
 for (int i = 2; i < primes.length; i++) {
 if (primes[i]) {
 System.out.print(i + " ");
 }
 }
 System.out.println();
 }
}

2 015

#Java #Algorithm #PrimeNumbers

2 015

Sieve of Eratosthenes

public class Sieve {
 public static boolean[] sieve(int n) {
 boolean[] isPrime = new boolean[n + 1];
 for (int i = 2; i <= n; i++) {
 isPrime[i] = true;
 }
 for (int p = 2; p * p <= n; p++) {
 if (isPrime[p]) {
 for (int i = p * p; i <= n; i += p) {
 isPrime[i] = false;
 }
 }
 }
 return isPrime;
 }

 public static void main(String[] args) {
 boolean[] primes = sieve(30);
 for (int i = 2; i < primes.length; i++) {
 if (primes[i]) {
 System.out.print(i + " ");
 }
 }
 System.out.println();
 }
}

2 015

#Java #Algorithm #PrimeNumbers

2 015

Sieve of Eratosthenes

public class Sieve {
 public static boolean[] sieve(int n) {
 boolean[] isPrime = new boolean[n + 1];
 for (int i = 2; i <= n; i++) {
 isPrime[i] = true;
 }
 for (int p = 2; p * p <= n; p++) {
 if (isPrime[p]) {
 for (int i = p * p; i <= n; i += p) {
 isPrime[i] = false;
 }
 }
 }
 return isPrime;
 }

 public static void main(String[] args) {
 boolean[] primes = sieve(30);
 for (int i = 2; i < primes.length; i++) {
 if (primes[i]) {
 System.out.print(i + " ");
 }
 }
 System.out.println();
 }
}

2 015

#Java #Algorithm #PrimeNumbers