Revision as of 01:21, 28 February 2024

Problem Description

A path is a sequence of nodes $x_{i}$ such that for all consecutive nodes, there exist an edge

@@ Line 1: / Line 1: @@
-<syntaxhighlighting lang="python" line>
+= Problem Description =
-def quick_sort(arr):
-	less = []
+A path is a sequence of nodes <math>x_i</math>
-	pivot_list = []
+such that for all consecutive nodes, there exist an edge
-	more = []
-	if len(arr) <= 1:
-		return arr
-	else:
-		pass
-</syntaxhighlighting>