Problem: In this problem, we would like to re-implement a selection sort to sort an array of numbers with some improvements. Selection Sort divides the input list into two parts: the sublist of elements already sorted and the unsorted sublist of elements remaining to be sorted. - find the smallest element in the unsorted sublist - swap this element with the leftmost unsorted element, it equivalents to move this element from the unsorted sublist to the sorted one, - continue to proceed all elements in the unsorted sublist. Question 1: ▪ Propose a recursive algorithm (pseudo-code) for the above Selection Sort (combined with iteration if necessary). ▪ Implement the proposed pseudo-code using C/C++ ▪ Calculate the complexity of your program (Best scenario, Worst scenario, Average). Justify your answer.

Problem: In this problem, we would like to re-implement a selection sort to sort an array of numbers with some improvements. Selection Sort divides the input list into two parts: the sublist of elements already sorted and the unsorted sublist of elements remaining to be sorted. - find the smallest element in the unsorted sublist - swap this element with the leftmost unsorted element, it equivalents to move this element from the unsorted sublist to the sorted one, - continue to proceed all elements in the unsorted sublist. Question 1: ▪ Propose a recursive algorithm (pseudo-code) for the above Selection Sort (combined with iteration if necessary). ▪ Implement the proposed pseudo-code using C/C++ ▪ Calculate the complexity of your program (Best scenario, Worst scenario, Average). Justify your answer.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 16PE

See similar textbooks

Similar questions

b) Selection sort can also be applied to linked lists because the general algorithm is the same. Write a simple program code to illustrates a selection sort based on array list that takes a series of input numbers from user and print the before and after sorting Ilist. Use the 'arrayListType.h' library in your program.
Write a function that takes in n ADT Lists in an array. The function is going to be called Intersection, and it will return a new list with the elements common to all the n lists. Determine the time complexity
Introduction For this assignment, you are to write a program which implements a Sorted List data structure using a circular array-based implementation and a driver program that will test this implementation. The Sorted List ADT is a linear collection of data in which all elements are stored in sorted order. Your implementation has to store a single int value as each element of the list and support the following operations: 1. add(x) – adds the integer x to the list. The resulting list should remain sorted in increasing order. The time complexity of this operation should be 0(N), where N is the size of the list. 2. removefirst() - deletes the first integer from the list and returns its value. The remaining list should remain sorted. Time complexity of this operation should be 0(1). 3. removelast() – deletes the last integer from the list and returns its value. The remaining list should remain sorted. Time complexity of this operation should be 0(1). 4. exists(x) – returns true if the…
Exercise 1:In this problem, we would like to implement a variation of the Bubble Sort algorithm. The algorithm differs from a bubble sort in that it sorts in both directions on each pass through the list. The algorithm is illustrated as in the following figure: For the first step, we perform bubble sort from the index 1 to n (n is thenumber of elements in the array). The next step, we perform a reserved bubble sort from the index n to 1. The process is repeated until all the array is sorted. Propose a pseudo-code to complete the Bubble Sort algorithm. Implement and test this algorithm in C/C++. Analyze and compute the complexity of this algorithm in the best, average and worst scenarios.Exercise 2:Re-implement Exercise 1 using a linear data structure: List, Stack, Queue. Justify your choice of data structure.
In an array-based implementation of a List, why does the add operation take O(n) time in the average case? Select one: a. The time it takes to shift entries over to make room in the array depends on the number of entries in the List b. The time to copy the current entries into a newly allocated, larger array depends on the number of entries in the List c. The time to access the position in the array to add the new entry depends on the number of entries in the List d. The time to access the position in the array to add the new entry depends on the capacity of the array
PROBLEM STATEMENT: In this problem you will need to update a specific array element. You are provided twoarguments one being the value for the update and then other being the index to where youwill want to do the update. import java.util.ArrayList;public class UpdateSpecificElement{public static ArrayList<Integer> solution(ArrayList<Integer> list, int val, int index){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>(); Can you help me with this question The language is Java
Please Answer Correct and fast
Improved Bubble Sort: One possible improvement for Bubble Sort would be to add a ﬂag variable and a test that determines if an exchange was made during the current iteration. If no exchange was made, then the list is sorted and so the algorithm can stop early. This makes the best case performance become O(n) (because if the list is already sorted, then no iterations will take place on the ﬁrst pass, and the sort will stop right there). Modify the Bubble Sort implementation to add this ﬂag and test. by using java Implement both the Double Insertion sort and the Improved Bubble sort algorithm on a randomly generated list of N integer Your program should output only the running time. To measure the sorting time, call System.currentTimeMillis() just before and just after the sorting and take the difference. Submit a copy of your code.
1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).
Module 5: Merge Sort Merge Sort works by continuously partitioning a list into two smaller sub-lists so it is working with smaller sub-lists during each recursive call. When does the Merge Sort method stop partitioning a list into sub-lists and begin returning? After four divides When each sublist has one element When each sublist is already sorted When each sublist has two elements
/Recursive Insertion Sort to sort list[first...last] recursively//You need to use BinarySearch // BinarySearch(vector<int> & length_list, int first, int last, int target_value) void InsertionSort (vector & list, int first, int last){ }
Consider the following list, which is sorted by insertion sort for array-based lists: 28, 18, 21, 10, 25, 30, 12, 71, 32, 58, 15 Show the resulting list after six passes of the sorting phase—that is, after six iterations of the for-loop.