Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static int[] uniqueRandomElements (int size) {
- int[] a = new int[size];
- for (int i = 0; i < size; i++) {
- a[i] = (int)(Math.random()*10);
- for (int j = 0; j < i; j++) {
- if (a[i] == a[j]) {
- a[j] = (int)(Math.random()*10);
- }
- }
- }
- for (int i = 0; i < a.length; i++) {
- System.out.print(a[i]+" ");
- }
- System.out.println();
- return a;
- }
- for (int i = 0; i < size; i++) {
- a[i] = (int)(Math.random()*10);
- for (int j = 0; j < i; j++) {
- if (a[i] == a[j]) {
- a[j] = (int)(Math.random()*10); //What's this! Another random number!
- }
- }
- }
- for (int i = 0; i < size; i++) {
- a[i] = (int)(Math.random()*10);//note, this generates numbers from [0,9]
- for (int j = 0; j < i; j++) {
- if (a[i] == a[j]) {
- i--; //if a[i] is a duplicate of a[j], then run the outer loop on i again
- break;
- }
- }
- }
- ArrayList<Integer> a = new ArrayList<>(11);
- for (int i = 0; i <= 10; i++){ //to generate from 0-10 inclusive.
- //For 0-9 inclusive, remove the = on the <=
- a.add(i);
- }
- Collections.shuffle(a);
- a = a.sublist(0,4);
- //turn into array
- ArrayList<Integer> list = new ArrayList<>(11);
- for (int i = 0; i <= 10; i++){
- list.add(i);
- }
- int[] a = new int[size];
- for (int count = 0; count < size; count++){
- a[count] = list.remove((int)(Math.random() * list.size()));
- }
- while (true) {
- boolean need_to_break = true;
- for (int j = 0; j < i; j++) {
- if (a[i] == a[j]) {
- need_to_break = false; // we might get another conflict
- a[j] = (int)(Math.random()*10);
- }
- }
- if (need_to_break) break;
- }
- int max_number = 10;
- int[] all_numbers = new int[max_number];
- for (int i = 0; i < max_number; i++)
- all_numbers[i] = i;
- /* randomly permute the sequence */
- for (int i = max_number - 1; i >= 0; i--) {
- int j = (int)(Math.random() * i); /* pick a random number up to i */
- /* interchange the last element with the picked-up index */
- int tmp = all_numbers[j];
- all_numbers[j] = a[i];
- all_numbers[i] = tmp;
- }
- /* get the a array */
- for (int i = 0; i < size; i++)
- a[i] = all_numbers[i];
- int [] arr = [1,2,3,.....(size)]; //this is pseudo code
- Collections.shuffle(arr);// you probably need to convert it to list first
- public Integer[] generateUnsortedIntegerArray(int numElements){
- // Generate an array of integers
- Integer[] randomInts = new Integer[numElements];
- for(int i = 0; i < numElements; ++i){
- randomInts[i] = i;
- }
- // Do the Knuth shuffle
- for(int i = 0; i < numElements; ++i){
- int randomIndex = (int)Math.floor(Math.random() * (i + 1));
- Integer temp = randomInts[i];
- randomInts[i] = randomInts[randomIndex];
- randomInts[randomIndex] = temp;
- }
- return randomInts;
- }
- import java.util.Scanner;
- class Unique
- {
- public static void main(String[]args)
- {
- int i,j;
- Scanner in=new Scanner(System.in);
- int[] a=new int[10];
- System.out.println("Here's a unique no.!!!!!!");
- for(i=0;i<10;i++)
- {
- a[i]=(int)(Math.random()*10);
- for(j=0;j<i;j++)
- {
- if(a[i]==a[j])
- {
- i--;
- }
- }
- }
- for(i=0;i<10;i++)
- {
- System.out.print(a[i]);
- }
- }
- }
- public static ArrayList<Integer> noRepeatShuffleList(int size) {
- ArrayList<Integer> arr = new ArrayList<>();
- for (int i = 0; i < size; i++) {
- arr.add(i);
- }
- Collections.shuffle(arr);
- return arr;
- }
- int[] a = new int[20];
- for (int i = 0; i < size; i++) {
- a[i] = (int) (Math.random() * 20);
- for (int j = 0; j < i; j++) {
- if (a[i] == a[j]) {
- a[i] = (int) (Math.random() * 20); //What's this! Another random number!
- i--;
- break;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement