zoukankan      html  css  js  c++  java
  • [GeeksForGeeks] Shuffle a given array

    Given an array, write a program to generate a random permuation of array elements. This question is also asked as "shuffle a deck of cards" or "randomize a given array".

    Solution 1.   O(n^2) runtime, O(n) space

    1. create an auxillary array list temp which is initially a copy of the given array arr[].

    2. randomly select an element from temp, copy it to arr[0] and remove it from temp.

    3. repeat the same process n times and keep copying elements to arr[1], arr[2].....

    Solution 2. Fisher-Yates shuffle algorithm, O(n) runtime, O(1) space

    The assumption here is, we are given a function rand() that generates random number in O(1) time.

    The idea is to start from the last element, swap it with a randomly selected element from the whole array (including last).

    Now consider the array from 0 to n-2 (size reduced by 1), and repeat the process till we hit the first element.

    Proof of correctness

    The probability that ith element (including the last one) goes to last position is 1/n, because we randomly pick an element in first iteration.

    The probability that ith element goes to second last position can be proved to be 1/n by dividing it in two cases.
    Case 1: i = n-1 (index of last element):
    The probability of last element going to second last position is = (probability that last element doesn't stay at its original position) x (probability that the index picked in previous step is picked again so that the last element is swapped)
    So the probability = ((n-1)/n) x (1/(n-1)) = 1/n
    Case 2: 0 < i < n-1 (index of non-last):
    The probability of ith element going to second position = (probability that ith element is not picked in previous iteration) x (probability that ith element is picked in this iteration)
    So the probability = ((n-1)/n) x (1/(n-1)) = 1/n

    We can easily generalize above proof for any other position.

     1 import java.util.Random;
     2 
     3 public class Solution {
     4     public void randomizeArray(int[] arr) {
     5         if(arr == null || arr.length <= 1){
     6             return;
     7         }
     8         Random rand = new Random();
     9         for(int i = arr.length - 1; i >= 1; i--){
    10             int j = rand.nextInt(i + 1);
    11             int temp = arr[i];
    12             arr[i] = arr[j];
    13             arr[j] = temp;
    14         }
    15     }
    16 }
  • 相关阅读:
    【ICLR2018】Mixup 解读
    MobileNetV2 解读
    MobileNetV1 解读
    AdaIN 解读
    心灵奇旅
    SA-Net: Shuffle Attention for Deep Convolutional Neural Networks
    ShuffleNet V1 解读
    情人节看《唐探3》
    拆弹人
    内卷常态下的就业烦恼
  • 原文地址:https://www.cnblogs.com/lz87/p/7292402.html
Copyright © 2011-2022 走看看