Put your code below and I am using Processing.

Count how many comparisons and swaps each algorithm makes on each of the combinations. Fill out this chart: num Order Algorithm Size Comparisons Swaps 7 random 8 random 9 random 10 sorted 11 sorted 12 sorted 13 random 14 random 15 random 16 sorted 17 sorted 18 sorted 1 random double trouble_sort 100 2 random double trouble _sort 1,000 3 random double trouble sort 10,000 4 sorted double trouble sort 100 5 sorted double trouble sort 1,000 6 sorted double trouble sort 10,000 bubble sort 100 bubble sort 1,000 bubble_sort 10,000 bubble_sort 100 bubble sort 1,000 bubble sort 10,000 quick sort 100 quick sort 1,000 quick sort 10,000 quick sort 100 quick sort 1,000 quick sort 10,000 Count how many comparisons and swaps each algorithm makes on each of the combinations. Fill out this chart: num Order Algorithm Size Comparisons Swaps 7 random 8 random 9 random 10 sorted 11 sorted 12 sorted 13 random 14 random 15 random 16 sorted 17 sorted 18 sorted 1 random double trouble_sort 100 2 random double trouble _sort 1,000 3 random double trouble sort 10,000 4 sorted double trouble sort 100 5 sorted double trouble sort 1,000 6 sorted double trouble sort 10,000 bubble sort 100 bubble sort 1,000 bubble_sort 10,000 bubble_sort 100 bubble sort 1,000 bubble sort 10,000 quick sort 100 quick sort 1,000 quick sort 10,000 quick sort 100 quick sort 1,000 quick sort 10,000