Create an array of 100 random numbers between 0-100. Sort the array using bubble sort and insertion sort. Create two counters to keep track of the number of swap operations taken for each sort algorithm and compare them. Which sort algorithm is more efficient?