kirinmanDevBlog

[문제 링크] https://www.hackerrank.com/challenges/quicksort1/problem?isFullScreen=true Quicksort 1 - Partition | HackerRank Perform the first step of Quicksort: partitioning an array. www.hackerrank.com public class QuickSort1Partition { public static void main(String[] args) { List arr = Arrays.asList(4, 5, 3, 7, 2); Listanswer = quickSort(arr); output(answer); } public static List quickSort(List a..