-
Notifications
You must be signed in to change notification settings - Fork 20.1k
Feature shuffle array #6026
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
siriak
merged 15 commits into
TheAlgorithms:master
from
rashi07dashore:Feature-ShuffleArray
Oct 29, 2024
Merged
Feature shuffle array #6026
Changes from 1 commit
Commits
Show all changes
15 commits
Select commit
Hold shift + click to select a range
6a7bd63
feature: Adding MinSumKSizeSubarray in Sliding
rashi07dashore c7b61e6
Merge branch 'master' into Feature-slidingWindowUpdated
rashi07dashore 049aba8
Merge branch 'master' into Feature-slidingWindowUpdated
rashi07dashore 3a7ac38
slidingWindowUpdated with MinSumKSizeSubarray
rashi07dashore 80ebb48
updated the line format
rashi07dashore ab5b0d3
Merge branch 'master' into Feature-slidingWindowUpdated
rashi07dashore c76f662
line updated
rashi07dashore 8139629
Merge branch 'Feature-slidingWindowUpdated' of https://github.com/ras…
rashi07dashore c1f52e9
lines updated
rashi07dashore 53b3699
Added Shuffle Algorithm
rashi07dashore eb5bfb5
Added Junit Testing
rashi07dashore 2a60bb1
updated line format
rashi07dashore 27bc1fb
update
rashi07dashore 799d7dc
Updated - removed the print method
rashi07dashore edf8e1e
Merge branch 'master' into Feature-ShuffleArray
siriak File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Added Shuffle Algorithm
Fisher-Yates (Knuth) Shuffle algorithm randomly permutes an array's elements, ensuring each permutation is equally likely.
- Loading branch information
commit 53b36994752c409feb590d4fbebc8fbce321c267
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,73 @@ | ||
package com.thealgorithms.misc; | ||
import java.util.Random; | ||
import java.util.Scanner; | ||
/** | ||
* The Fisher-Yates (Knuth) Shuffle algorithm randomly permutes an array's | ||
* elements, ensuring each permutation is equally likely. | ||
* | ||
* <p> | ||
* Worst-case performance O(n) | ||
* Best-case performance O(n) | ||
* Average performance O(n) | ||
* Worst-case space complexity O(1) | ||
* | ||
* This class provides a static method to shuffle an array in place. | ||
* | ||
* @author Your Name (https://github.com/Chiefpatwal) | ||
*/ | ||
public final class ShuffleArray { | ||
// Prevent instantiation | ||
private ShuffleArray() { | ||
} | ||
/** | ||
* This method shuffles an array using the Fisher-Yates algorithm. | ||
* | ||
* @param arr is the input array to be shuffled | ||
*/ | ||
public static void shuffle(int[] arr) { | ||
Random random = new Random(); | ||
for (int i = arr.length - 1; i > 0; i--) { | ||
int j = random.nextInt(i + 1); | ||
int temp = arr[i]; | ||
arr[i] = arr[j]; | ||
arr[j] = temp; | ||
} | ||
} | ||
/** | ||
* This method takes user input to create an array. | ||
* | ||
* @return the array created from user input | ||
*/ | ||
public static int[] getUserInputArray() { | ||
Scanner scanner = new Scanner(System.in); | ||
System.out.print("Enter the size of the array: "); | ||
int size = scanner.nextInt(); | ||
|
||
int[] arr = new int[size]; | ||
System.out.println("Enter " + size + " elements:"); | ||
for (int i = 0; i < size; i++) { | ||
arr[i] = scanner.nextInt(); | ||
} | ||
return arr; | ||
} | ||
public static void main(String[] args) { | ||
int[] userArray = getUserInputArray(); | ||
System.out.println("Original Array:"); | ||
printArray(userArray); | ||
|
||
shuffle(userArray); | ||
System.out.println("Shuffled Array:"); | ||
printArray(userArray); | ||
} | ||
/** | ||
* This method prints the elements of the array. | ||
* | ||
* @param arr is the input array to be printed | ||
*/ | ||
public static void printArray(int[] arr) { | ||
for (int num : arr) { | ||
System.out.print(num + " "); | ||
} | ||
System.out.println(); | ||
} | ||
rashi07dashore marked this conversation as resolved.
Show resolved
Hide resolved
|
||
} |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.