01204212/integer sorting - ประวัติรุ่นแก้ไข

Jittat: /* Merge procedure */

2016-11-10T04:57:16Z

Merge procedure

2016-11-10T03:17:32Z

Merge procedure

2016-11-10T03:14:11Z

Merge procedure

2016-11-10T03:08:29Z

Merge procedure

2016-11-10T02:19:17Z

More codes

2016-11-10T02:16:09Z

Main template

2016-11-10T02:15:35Z

More codes

2016-11-10T02:11:55Z

2016-09-15T08:12:19Z

Code

2016-09-15T04:13:09Z

Code

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 04:57, 10 พฤศจิกายน 2559
แถว 316:		แถว 316:
	1229227		1229227
	</pre>		</pre>
		+
		+	=== Quick sort ===
		+	<syntaxhighlight lang="java">
		+	import java.io.BufferedReader;
		+	import java.io.InputStreamReader;
		+
		+	public class Main {
		+
		+	int n;
		+	int[] x;
		+
		+	public static void main(String[] args) {
		+	Main m = new Main();
		+
		+	m.readInput();
		+	m.process();
		+	m.output();
		+	}
		+
		+	private void process() {
		+	quickSort(x, 0, n-1);
		+	}
		+
		+	private void swap(int i, int j) {
		+	int tmp = x[i];
		+	x[i] = x[j];
		+	x[j] = tmp;
		+	}
		+
		+	private void quickSort(int[] x, int left, int right) {
		+	if(left >= right) {
		+	return;
		+	}
		+	int pivot = x[right];
		+
		+	int mid = partition(x, left, right-1, pivot);
		+	swap(mid, right);
		+
		+	quickSort(x, left, mid-1);
		+	quickSort(x, mid+1, right);
		+	}
		+
		+	private int partition(int[] x, int a, int b, int pivot) {
		+	// your code here...
		+	return 0;
		+	}
		+
		+	private void output() {
		+	for(int i=0; i<n; i++) {
		+	System.out.println(x[i]);
		+	}
		+	}
		+
		+	private void readInput() {
		+	BufferedReader reader = new BufferedReader(
		+	new InputStreamReader(System.in) );
		+
		+	try {
		+	n = Integer.parseInt(reader.readLine());
		+	x = new int[n];
		+
		+	for(int i=0; i<n; i++) {
		+	x[i] = Integer.parseInt(reader.readLine());
		+	}
		+	} catch(Exception e) {
		+	System.out.println("Input error");
		+	n = 0;
		+	x = null;
		+	}
		+	}
		+	}
		+	</syntaxhighlight>

@@ แถว 228: / แถว 228: @@
      private void output() {
-     	for(int i=0; i<n; i++) {
+     	for(int i=0; i<2*n; i++) {
-     	    System.out.println(x[i]);
+     	    System.out.println(z[i]);
+     	}
+     }

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 03:14, 10 พฤศจิกายน 2559
แถว 262:		แถว 262:
	}		}
	</syntaxhighlight>		</syntaxhighlight>
		+
		+	==== Test data ====
		+
		+	Download at: http://theory.cpe.ku.ac.th/~jittat/courses/01204212/tasks/merge/
		+
		+	'''output for n10.in'''
		+
		+	<pre>
		+	9518
		+	9773
		+	13550
		+	16202
		+	19018
		+	21364
		+	23100
		+	41323
		+	50386
		+	52901
		+	54817
		+	59660
		+	60935
		+	72203
		+	76136
		+	81658
		+	82595
		+	96681
		+	98951
		+	99783
		+	</pre>
		+
		+	'''output for n1000.in''' (first 20 lines)
		+
		+	<pre>
		+	544
		+	254319
		+	390209
		+	450482
		+	524808
		+	538705
		+	540179
		+	587455
		+	593714
		+	732355
		+	833118
		+	917092
		+	937963
		+	953946
		+	972253
		+	1007653
		+	1135211
		+	1162167
		+	1196548
		+	1229227
		+	</pre>

@@ แถว 224: / แถว 224: @@
      private void process() {
+     }
@@ แถว 233: / แถว 234: @@
      private void merge(int[] x, int[] y, int[] z) {
+     	// your code here
+     }
@@ แถว 244: / แถว 245: @@
              x = new int[n];
              y = new int[n];
-             z = new int[n];
+             z = new int[2*n];
              for(int i=0; i<n; i++) {

@@ แถว 198: / แถว 198: @@
              n = 0;
              x = null;
+         }
+     }
+}
 </syntaxhighlight>

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 02:15, 10 พฤศจิกายน 2559
แถว 150:		แถว 150:

	This section of codes are for Quicksort and Mergesort implementations.		This section of codes are for Quicksort and Mergesort implementations.
		+
		+	=== Main template ===
		+	<syntaxhighlight lang="java">
		+	import java.io.BufferedReader;
		+	import java.io.InputStreamReader;
		+
		+	public class Main {
		+
		+	int n;
		+	int[] x;
		+
		+	public static void main(String[] args) {
		+	Main m = new Main();
		+
		+	m.readInput();
		+	m.process();
		+	m.output();
		+	}
		+
		+	private void process() {
		+	sortArray(x);
		+	}
		+
		+	private void output() {
		+	for(int i=0; i<n; i++) {
		+	System.out.println(x[i]);
		+	}
		+	}
		+
		+	private void sortArray(int[] x) {
		+	// ... put your code here
		+	}
		+
		+	private void readInput() {
		+	BufferedReader reader = new BufferedReader(
		+	new InputStreamReader(System.in) );
		+
		+	try {
		+	n = Integer.parseInt(reader.readLine());
		+	x = new int[n];
		+
		+	for(int i=0; i<n; i++) {
		+	x[i] = Integer.parseInt(reader.readLine());
		+	}
		+	} catch(Exception e) {
		+	System.out.println("Input error");
		+	n = 0;
		+	x = null;
		+	}
		+	}
		+	}
		+	</syntaxhighlight>

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 02:11, 10 พฤศจิกายน 2559
แถว 146:		แถว 146:
	}		}
	</syntaxhighlight>		</syntaxhighlight>
		+
		+	== More codes ==
		+
		+	This section of codes are for Quicksort and Mergesort implementations.

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 08:12, 15 กันยายน 2559
แถว 114:		แถว 114:

	sortList(inList, outList);		sortList(inList, outList);
−
−	~~for(Iterator<Integer> i=outList.iterator(); i.hasNext();) {~~
−	~~System.out.println(i.next());~~
−	}
	}		}

@@ แถว 87: / แถว 87: @@
 == Code ==
 <syntaxhighlight lang="java">
 import java.io.BufferedReader;