codeyangjun
diff --git a/‎1) Array inversions.py‎ ‎01) Array inversions.py‎1) Array inversions.py renamed to 01) Array inversions.py
Lines changed: 2 additions & 0 deletions b/‎1) Array inversions.py‎ ‎01) Array inversions.py‎1) Array inversions.py renamed to 01) Array inversions.py
Lines changed: 2 additions & 0 deletions
diff --git a/‎2) QuickSort - comparisons.py‎ ‎02) QuickSort - comparisons.py‎2) QuickSort - comparisons.py renamed to 02) QuickSort - comparisons.py b/‎2) QuickSort - comparisons.py‎ ‎02) QuickSort - comparisons.py‎2) QuickSort - comparisons.py renamed to 02) QuickSort - comparisons.py
diff --git a/‎3) Karger randomized MinCut.py‎ ‎03) Karger randomized MinCut.py‎3) Karger randomized MinCut.py renamed to 03) Karger randomized MinCut.py b/‎3) Karger randomized MinCut.py‎ ‎03) Karger randomized MinCut.py‎3) Karger randomized MinCut.py renamed to 03) Karger randomized MinCut.py
diff --git a/‎4) Kosaraju SCC.py‎ ‎04) Kosaraju SCC.py‎4) Kosaraju SCC.py renamed to 04) Kosaraju SCC.py b/‎4) Kosaraju SCC.py‎ ‎04) Kosaraju SCC.py‎4) Kosaraju SCC.py renamed to 04) Kosaraju SCC.py
diff --git a/‎5) Dijkstra shortest paths.py‎ ‎05) Dijkstra shortest paths.py‎5) Dijkstra shortest paths.py renamed to 05) Dijkstra shortest paths.py b/‎5) Dijkstra shortest paths.py‎ ‎05) Dijkstra shortest paths.py‎5) Dijkstra shortest paths.py renamed to 05) Dijkstra shortest paths.py
diff --git a/‎6a) 2SUM.py‎ ‎06a) 2SUM.py‎6a) 2SUM.py renamed to 06a) 2SUM.py b/‎6a) 2SUM.py‎ ‎06a) 2SUM.py‎6a) 2SUM.py renamed to 06a) 2SUM.py
diff --git a/‎6b) Median maintenance.py‎ ‎06b) Median maintenance.py‎6b) Median maintenance.py renamed to 06b) Median maintenance.py b/‎6b) Median maintenance.py‎ ‎06b) Median maintenance.py‎6b) Median maintenance.py renamed to 06b) Median maintenance.py
diff --git a/‎7a) Greedy jobs scheduling.py‎ ‎07a) Greedy jobs scheduling.py‎7a) Greedy jobs scheduling.py renamed to 07a) Greedy jobs scheduling.py
Lines changed: 8 additions & 2 deletions b/‎7a) Greedy jobs scheduling.py‎ ‎07a) Greedy jobs scheduling.py‎7a) Greedy jobs scheduling.py renamed to 07a) Greedy jobs scheduling.py
Lines changed: 8 additions & 2 deletions
diff --git a/‎7b) Prim's MST.py‎ ‎07b) Prim's MST.py‎7b) Prim's MST.py renamed to 07b) Prim's MST.py b/‎7b) Prim's MST.py‎ ‎07b) Prim's MST.py‎7b) Prim's MST.py renamed to 07b) Prim's MST.py
diff --git a/‎8) Single-linkage greedy clustering.py‎ ‎08) Single-linkage greedy clustering.py‎8) Single-linkage greedy clustering.py renamed to 08) Single-linkage greedy clustering.py b/‎8) Single-linkage greedy clustering.py‎ ‎08) Single-linkage greedy clustering.py‎8) Single-linkage greedy clustering.py renamed to 08) Single-linkage greedy clustering.py
@@ -1,4 +1,6 @@
 '''
+Algorithms - design and analysis (Stanford), Part I.
+
 Programming assignment 1:
 
 count the number of inversions
 
@@ -1,5 +1,11 @@
-# Algorithms - design and analysis (Stanford), Part II.
-# Programming Assignment 1-1: Greedy jobs scheduling
+'''
+Algorithms - design and analysis (Stanford), Part II.
+
+Programming Assignment 1-1:
+Greedy jobs scheduling
+
+@author: Mikhail Dubov
+'''
 
 def greedy_minimal_weighted_sum(jobs, greedy_criterion, ties_criterion):