Sales Associate Resume Example

Specializing in maintaining company infrastructures and user systems. Highly effective at providing personal and remote support. Results-oriented and self-directed team player with an unsurpassed work ethic and energetic personality.

• For Selection sort, it selects the first element in the list. Then, it compares to the next element in the list to compare which is the highest integer of the two. If the first element is greater than the second, it selects the second. If not, it goes to the next element for comparison. If the first element is greater than the element after the second, it selects the latter element. If not, it goes to the element after. It repeats this process until it gets to the end of the list. The element that is selected at the end goes to index 0. Then, it selects the element in index 1, and repeat the comparison process. This whole process repeats until the whole list is sorted in ascending order. For Quick sort, it selects the first element in the list as the pivot. Then, it goes through each element in the list to compare which element is less than the pivot. If an element is less than the pivot, it switches with the leftmost element that is greater than the pivot. Once this iteration finishes, the pivot switches with the rightmost element less than itself. Then, the process repeats with all the elements on the left side of the pivot, with the new pivot being the leftmost element because the old pivot is set in the correct position. Quick sort will divide the list into sections that will compare themselves to ultimately sort itself into ascending order.Selection sortN=10,000Average runtime=1,062,276N=50,000Average runtime=2,663,178.6N=100,000Average runtime=10,644,659.8Quick sortN=10,000Average runtime=1N=50,000Average runtime=0.8N=100,000Average runtime= 1.2For the size of the input for selection sort, the runtime increases as the size increases. For instance, n=10,000 was on average=1,062,276, n=50,000 was on average=2,663,178.6, and n=100,000 was on average=10,644,659.8. Since selection sort has to run through the list as many times as the number of elements, it justifies the runtimes. For the size of the input for quick sort, the runtime decreased and increased; thus, it varied as the size increased. For instance, n=10,000 was on average=1, n=50,000 was on average=0.8, and n=100,000 was on average=1.2. Due to the pivot being any integer, which could be higher or lower compared to the other integers, it does justify the varied runtimes.For selection sort, the runtime was shorter for the ascending list compared to the descending list since the ascending list would require zero swapping. On the other hand, the descending list would have to swap after each iteration. For example, n=10,000 had a fairly quicker runtime for the ascending list compared to the descending list. For quick sort, it was equal until n=100,000, which was the ascending having the shorter runtime. Since the pivot in the ascending list was the smallest element, it passed to the next element in the list after each iteration, which was larger compared to the last. Therefore, the ascending list would have finished quicker than the descending list.