HomeworkLib
Question

7. (20 points) Assume L is a list, and assume that int n=L length() returns the number of elements in the list, and Bubblsort
1. Assume that the values 1 through 8 are stored in a self organizing list, initially in increasing order. For each of the th
Comments
    Next > < Previous
    Sort answers by oldest

    Homework Answers

    Answer #1

    7) a. \Theta(n2 logn)

    Explanation: We know that Bubble Sort worst case time complexity is O(n2)
    for loop will take log n time and everytime it will swap i elements and in worst case it will take O(n2 logn)

    7) b. \Theta(n4)

    Explanation: We know that Bubble Sort worst case time complexity is O(n2)
    for loop will take n2 time and everytime it will swap i elements and in worst case it will take n2 x n2 = n4


    Thanks, PLEASE COMMENT if there is any concern.

    For 1. Please provide more data , because we don't know what was learned in class

    0 0
    Add a comment
    Know the answer?
    Add Answer to:
    7. (20 points) Assume L is a list, and assume that int n=L length() returns the number of element...
    Your Answer:

    Post as a guest

    Your Name:

    What's your source?

    Earn Coins

    Coins can be redeemed for fabulous gifts.

    Log In

    Sign Up

    Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
    Similar Homework Help Questions

    • Assume L is an array, length(L) returns the number of records in the array, and qsort(L,i,j)...

      Assume L is an array, length(L) returns the number of records in the array, and qsort(L,i,j) sorts the records of L from i toj (leaving the records sorted in L) using the Quicksort algorithm. What is the average-case complexity for the following code fragment? for (i = @; i<length(L); i++) asort(1, 0, 1); Consider the time for each pass of the for loop, and sum them all together. Prove the upper and lower bound, then argue for an average case....

    • vas Х Assume Lis an array, length(L) returns the number of records in the array, and...

      vas Х Assume Lis an array, length(L) returns the number of records in the array, and qsort(L. 1.j) sorts the records of Lfrom itoj (leaving the records sorted in L) using the Quicksort algorithm. What is the average-case complexity for the following code fragment? for (i = 0; i<length(); i++) asort(1, 0, 1); Consider the time for each pass of the for loop, and sum them all together. Prove the upper and lower bound, then argue for an average case....

    • C++ Question 14 10 Assume Lis an array, length(L) returns the number of records in the...

      C++ Question 14 10 Assume Lis an array, length(L) returns the number of records in the array, and qsort(L, 1. j) sorts the records of L from i toj (leaving the records sorted in L) using the Quicksort algorithm. What is the average-case complexity for the following code fragment? for (i = 0; i<length(); i++) asort(L, 0, 1); Consider the time for each pass of the for loop, and sum them all together. Prove the upper and lower bound, then...

    • Assume L is an array, length(L) returns the number of records in the array, and qsort(L, i, j) sorts the records of L from i to j (leaving the records sorted in L) using the Quicksort algorithm. What is the averagecase time complexity for each of the foll

      Assume L is an array, length (L) returns the number of records in the array, and qsort \((L, \quad i, j)\) sorts the records of \(L\) from \(i\) to \(j\) (leaving the records sorted in L) using the Quicksort algorithm. What is the average-case complexity for the following code fragment?$$ \begin{array}{c} \text { for }(\mathrm{i}=0 ; \text { i<length }(\mathrm{L}) ; \mathrm{i}++) \\ \text { qsort }(\mathrm{L}, 0, \mathrm{i}) ; \end{array} $$You should provide a formula for computing the total...

    • Puodace a char showing the number of moves required to solve the Towers of Hanoi puzle using t 30...

      Puodace a char showing the number of moves required to solve the Towers of Hanoi puzle using t 30. What is an execution frame? What is an activation record? What is contained in it? 31. Write a recursive Java method that computes the factorial of a number 2. Linear search may require up to comparisons while binary search will only require roughly comparisons 33. Sort sorts a list of values by repetitively putting a particular value into its final, sorted,...

    • Question 13 pts (TCO 4) Which of the following functions grows at a slower rate than...

      Question 13 pts (TCO 4) Which of the following functions grows at a slower rate than the rest? n2 n log n n3 Flag this Question Question 23 pts (TCO 4) Algorithms can be described using pseudo-code. assignment and arithmetic operations. loops and decision statements. All of the above Flag this Question Question 33 pts (TCO 4) The running time of an algorithm is the time, in milliseconds, it takes to complete its execution. the running time of its implementation....

    • Question3 10 pts Let A [L.n] be a max-heap with n > 1 and consider the index ị such that l 〈 i 〈 n . Assume that a...

      Question3 10 pts Let A [L.n] be a max-heap with n > 1 and consider the index ị such that l 〈 i 〈 n . Assume that all the elements of A are distinct. Write the pseudocode of an algorithm which replaces A [i] by A i 100 and then re-arranges the elements of A into a max-heap. The running time of your algorithm must be O (log, n Upload Choose a File Question3 10 pts Let A [L.n]...

    • And the related algorithms: (20 points) Consider the following strategy for choosing a pivot element for...

      And the related algorithms: (20 points) Consider the following strategy for choosing a pivot element for the Partition subroutine of QuickSort, applied to an array A. .Let n be the number of elements of the array A. If n 24, perform an Insertion Sort of A and return. Otherwise: Choose 2n/2)| elements at random from n; let S be the new list with the chosen elements. Sort the list S using Insertion Sort and use the median m of S...

    • Java Programming Write a program to find the number of comparison using binarySearch and the sequentialSearch...

      Java Programming Write a program to find the number of comparison using binarySearch and the sequentialSearch algorithms as follows: Suppose list is an array of 2500 elements. 1. Use a random number generator to fill list; 2. Use a sorting algorithm to sort list; 3. Search list for some items as follows: a) Use the binary search algorithm to search list (please work on SearchSortAlgorithms.java and modify the algorithm to count the number of comparisons) b) Use the sequential search...

    ADVERTISEMENT
    Free Homework Help App
    Download From Google Play
    Scan Your Homework
    to Get Instant Free Answers
    Need Online Homework Help?
    Ask a Question
    Get Answers For Free
    Most questions answered within 3 hours.
    ADVERTISEMENT
    ADVERTISEMENT