Algo lab/running times - ประวัติรุ่นแก้ไข

Jittat: /* Test data */

2018-09-03T00:56:15Z

Test data

2018-09-03T00:55:46Z

Your job

2018-09-03T00:55:27Z

2018-09-03T00:54:46Z

Task 1: Closest pairs

2018-09-03T00:52:05Z

2018-09-03T00:51:32Z

2018-09-03T00:51:08Z

2018-09-03T00:50:32Z

2018-09-03T00:49:46Z

2018-09-03T00:47:42Z

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 00:56, 3 กันยายน 2561
แถว 91:		แถว 91:

	== Test data ==		== Test data ==
		+	* Download [https://theory.cpe.ku.ac.th/~jittat/algo-lab/running-times/testdata/ here]

@@ แถว 86: / แถว 86: @@
 === Your job ===
-* Template for quadratic solution [https://theory.cpe.ku.ac.th/~jittat/algo-lab/running-times/sort-slow-template.cpp closest-slow-template.cpp]
+* Template for quadratic solution [https://theory.cpe.ku.ac.th/~jittat/algo-lab/running-times/sort-slow-template.cpp sort-slow-template.cpp]
-* Fast solution [https://theory.cpe.ku.ac.th/~jittat/algo-lab/running-times/sort-fast.cpp closest-fast.cpp]
+* Fast solution [https://theory.cpe.ku.ac.th/~jittat/algo-lab/running-times/sort-fast.cpp sort-fast.cpp]
 * Test data: ''see below''
 == Test data ==

@@ แถว 42: / แถว 42: @@
 }}
 * Template for quadratic solution [https://theory.cpe.ku.ac.th/~jittat/algo-lab/running-times/closest-slow-template.cpp closest-slow-template.cpp]
 * Fast solution [https://theory.cpe.ku.ac.th/~jittat/algo-lab/running-times/closest-fast.cpp closest-fast.cpp]
@@ แถว 83: / แถว 84: @@
 </pre>
 }}
 == Test data ==

@@ แถว 41: / แถว 41: @@
 </pre>
 }}
 == Task 2: Sorting ==

@@ แถว 17: / แถว 17: @@
 '''Input'''
-* First line: integer '''n'''
+* First line: integer '''n'''  ('''n''' is at most 100,000)
 * Next '''n''' lines: each line contains one integer (ranging from 1 to 1,000,000,000)
@@ แถว 51: / แถว 51: @@
 '''Input'''
-* First line: integer '''n'''
+* First line: integer '''n''' ('''n''' is at most 100,000)
 * Next '''n''' lines: each line contains one integer (ranging from 1 to 1,000,000,000)

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 00:49, 3 กันยายน 2561
แถว 1:		แถว 1:
	: ''This is part of [[ske algo lab]]''		: ''This is part of [[ske algo lab]]''
		+
		+	== Lab descriptions ==
		+
		+	* Work on this [https://theory.cpe.ku.ac.th/wiki/images/Algo-lab-running-time.pdf lab sheet].
		+	* Write quadratic-time solutions to the following two problems.
		+	* Download fast solutions.
		+	* Measure their running times using provided test data and compare them.

	== Task 1: Closest pairs ==		== Task 1: Closest pairs ==

@@ แถว 3: / แถว 3: @@
 == Task 1: Closest pairs ==
-{{กล่องสี|#e0e0e0|
+{{กล่องสี|#e7e7e7|
 '''Task statement'''
@@ แถว 17: / แถว 17: @@
 * One line: the minimum difference between pairs of these integers.
 }}
 == Task 2: Sorting ==
 == Test data ==