|
[x]
Posted via EE Mobile
|
||
Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
||
| Question |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55: 56: 57: 58: 59: 60: 61: 62: 63: 64: 65: 66: 67: 68: 69: 70: 71: 72: 73: 74: |
import java.io.*;
import java.io.File;
import java.util.Scanner;
public class ss {
public static void main(String[] args) throws IOException {
System.out.print("Name of file with array: ");
Scanner readIn = new Scanner(System.in);
String input = readIn.nextLine();
testScan1(input);
}
public static void testScan1(String filename) {
File file = new File(filename);
Scanner scan;
int[] array;
try {
array = new int[5];
scan = new Scanner(file);
} catch (java.io.FileNotFoundException e) {
System.out.println("couldn't open. file not found ");
return;
}
int i =0;
while (scan.hasNext()) {
//for (i = 0; i <= file.length(); ++i)
array[i] = Integer.parseInt(scan.next());
i++;}
quickSort(array, 0, array.length-1);
partition(array, 0, array.length-1);
//System.out.println(java.util.Arrays.toString(array));
for (int j = 0; j < array.length; ++j)
System.out.println(array[i] + " ");
}
static int partition(int[] arr, int left, int right) {
int i = left;
int j = right;
int tmp;
int pivot = arr.length-1;
while (i <= j) {
while (arr[i] < pivot)
i++;
while (arr[j] > pivot)
j--;
if (i <= j) {
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}
}
return i;
}
static void quickSort(int[] arr, int left, int right) {
int index = partition(arr, left, right);
if (left < (index - 1)); {
}
quickSort(arr, left, index - 1);
if (index < right) {
quickSort(arr, index, right);
}
}
//for (int j = 0; j < array.length; ++j)
// System.out.println(array[i] + " ");
}
|
Advertisement
| Hall of Fame |