Problem 1 Sort 5; 3; 7; 8; 1; 9; 2; 4; 6 using the quicksort.
Problem 2
Implementation of any two algorithms from the following algorithms: Merge Sort, Quicksort, Binary Search, Euclidean Algorithm(for Önding gcd).
Run each of your programmes at least five times with different input/data. Submit you codes, screen shots.