ผลต่างระหว่างรุ่นของ "Algo lab/running times"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 17: แถว 17:
 
'''Input'''
 
'''Input'''
  
* First line: integer '''n'''  (1 <= '''n''' <= 100,000)
+
* First line: integer '''n'''  (1 &lt;= '''n''' &lt;= 100,000)
 
* Next '''n''' lines: each line contains one integer (ranging from 1 to 1,000,000,000)
 
* Next '''n''' lines: each line contains one integer (ranging from 1 to 1,000,000,000)
  
แถว 51: แถว 51:
 
'''Input'''
 
'''Input'''
  
* First line: integer '''n''' (1 <= '''n''' <= 100,000)
+
* First line: integer '''n''' (1 &lt;= '''n''' &lt;= 100,000)
 
* Next '''n''' lines: each line contains one integer (ranging from 1 to 1,000,000,000)
 
* Next '''n''' lines: each line contains one integer (ranging from 1 to 1,000,000,000)
  

รุ่นแก้ไขเมื่อ 00:51, 3 กันยายน 2561

This is part of ske algo lab

Lab descriptions

  • Work on this 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

{{{2}}}

Task 2: Sorting

{{{2}}}

Test data