What is the purpose of the following pseudocode: i = 0 j = length / 2...
What is the purpose of the following pseudocode:
i = 0 j = length / 2 While i < length / 2 # Swap elements at positions i and j temp = a[i] a[i] = a[j] a[j] = temp i = i + 1 j = j + 1
Group of answer choices
flip the first half of a list with the second half
sort the list from smallest to largest
sort the list from largest to smallest
reverse the entire list
Homework Answers
the purpose of the given pseudocode is to flip the first half of a list with the second half
flip the first half of a list with the second half
Add Answer to:
What is the purpose of the following pseudocode:
i = 0
j = length / 2...
In this assignment you will implement merge-sort algorithm by creating 2 threads instead of 2 pro...
In this assignment you will implement merge-sort algorithm by creating 2 threads instead of 2 processes. First half of the array will be sorted by thread 1 and the second half by thread 2. When the threads complete their tasks, the main program will merge the half arrays. You should not waste your time on merge-sort algorithm. Use the merge sort algorithm given below void mergesort(int a[],int i,int j) { int mid; if(i<j) { mid=(i+j)/2; mergesort(a,i,mid); //left recursion mergesort(a,mid+1,j); //right...
Please I am in a hurry, I need an answer asap. I have seen an answer previously regarding to this...
Please I am in a hurry, I need an answer asap. I have seen an answer previously regarding to this question, however I found a lot of mistakes on it, where the guy declared a public class, which is not a thing in C language. Furthermore it is important to divide the question into two C files, one for part a and one for part b. hw2 Merge Sort algorithm using 2 processes a.) Define an integer array of 100...
Please give a output Linux/Ubuntu and how to run it (compile) this program ,my assigment is below...
Please give a output Linux/Ubuntu and how to run it (compile) this program ,my assigment is below : : Merge Sort algorithm using 2 processes a.) Define an integer array of 100 integers. Populate this array with random numbers. You can use int rand(void); function. Do not forget to initialize this function. You will sort the numbers in the array using merge-sort algorithm. In merge sort algorithm the half of the array will be sorted by one process and second...
without coding Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr,...
without coding
Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr, low, high, x): # Check base case if low > high : return None else: mid = (high + low) // 2 element arr[mid] == X: if element return mid elif element > X: return binary-search(arr, low, mid 1, x) else: return binary_search(arr, mid + 1, high, x) Selection Sort: def selection_sort (arr): for i in range (len(arr)): smallest index = i smallest value...
Programming language: Java Home Work No.2 due 09.11.2019 either ascending or descending SORTING: An array is...
Programming language: Java
Home Work No.2 due 09.11.2019 either ascending or descending SORTING: An array is said to be ordered if its values order. In an ascending ordered array, the value of each element is less than or equal to the value of the next element. That is, [each element] <= [next element]. A sort is an algorithm for ordering an array. Of the many different techniques for sorting an array we discuss the bubble sort It requires the swapping...
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...
//Generic interface that describes various searching and sorting //algorithms. Note that the type parameter is unbounded....
//Generic interface that describes various searching and sorting //algorithms. Note that the type parameter is unbounded. However, //for these algorithms to work correctly, the data objects must //be compared using the method compareTo and equals. //In other words, the classes implementing the list objects //must implement the interface Comparable. The type parameter T //is unbounded because we would like to use these algorithms to //work on an array of objects as well as on objects of the classes //UnorderedArrayList and...
def selectionSortK(alist, k): for i in range(0,len(alist) - 1): min = i for j in range(i + 1, len(alist)): if alist[j] < alist[min]: min = j temp = alist[i] alist[i] = alist[min] alist[min] = temp...
def selectionSortK(alist, k):
for i in range(0,len(alist) - 1):
min = i
for j in range(i + 1, len(alist)):
if alist[j] < alist[min]:
min = j
temp = alist[i]
alist[i] = alist[min]
alist[min] = temp
P3: Sanity Test: Is selectionSortK callable? ... ok
test_doNothing (__main__.TestProblem3)
P3: Does sorting the first k elements with k=0 do nothing? ...
ok
test_onePass (__main__.TestProblem3)
P3: Sorting a portion of a decreasing list ... FAIL
test_severalPasses (__main__.TestProblem3)
P3: Sorting a decreasing list in several stages...
Create the following function in java: ALGORITHM PERMUTATION GENERATOR PermGenerator(integer n 22) li generates in lexicographical...
Create the following function in java:
ALGORITHM PERMUTATION GENERATOR PermGenerator(integer n 22) li generates in lexicographical order all permutations llof the integers in the set {I.....!! Local variables: integers i //indices of permutation elements integer //for loop counter integers d., d..., Mleft to right elements of a permutation Section 4.4 Permutations and Combinations 283 1/create and write out smallest permutation for k=1 to n do end for write d.d..... //create and write out remaining permutations for k = 2 to...
I need the report like this (idea) *Sorting Algorithms: A sorting algorithm is an algorithm that...
I need the report like this (idea) *Sorting Algorithms: A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonical zing data and for producing human-readable output. More formally, the output must satisfy...
without coding
Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr, low, high, x): # Check base case if low > high : return None else: mid = (high + low) // 2 element arr[mid] == X: if element return mid elif element > X: return binary-search(arr, low, mid 1, x) else: return binary_search(arr, mid + 1, high, x) Selection Sort: def selection_sort (arr): for i in range (len(arr)): smallest index = i smallest value...
Programming language: Java
Home Work No.2 due 09.11.2019 either ascending or descending SORTING: An array is said to be ordered if its values order. In an ascending ordered array, the value of each element is less than or equal to the value of the next element. That is, [each element] <= [next element]. A sort is an algorithm for ordering an array. Of the many different techniques for sorting an array we discuss the bubble sort It requires the swapping...
def selectionSortK(alist, k):
for i in range(0,len(alist) - 1):
min = i
for j in range(i + 1, len(alist)):
if alist[j] < alist[min]:
min = j
temp = alist[i]
alist[i] = alist[min]
alist[min] = temp
P3: Sanity Test: Is selectionSortK callable? ... ok
test_doNothing (__main__.TestProblem3)
P3: Does sorting the first k elements with k=0 do nothing? ...
ok
test_onePass (__main__.TestProblem3)
P3: Sorting a portion of a decreasing list ... FAIL
test_severalPasses (__main__.TestProblem3)
P3: Sorting a decreasing list in several stages...
Create the following function in java:
ALGORITHM PERMUTATION GENERATOR PermGenerator(integer n 22) li generates in lexicographical order all permutations llof the integers in the set {I.....!! Local variables: integers i //indices of permutation elements integer //for loop counter integers d., d..., Mleft to right elements of a permutation Section 4.4 Permutations and Combinations 283 1/create and write out smallest permutation for k=1 to n do end for write d.d..... //create and write out remaining permutations for k = 2 to...
Most questions answered within 3 hours.
-
1. Mini Case Study: Suppose that, in the future, most jobs will
be bid upon by...
asked 52 seconds from now -
For this Discussion, you examine a case study of
hearing-impaired children who developed their own language...
asked 29 seconds from now -
The moment of inertia of a disk rotating about its axis of
symmetry is Icm=1/2MR^2
The...
asked 6 minutes ago -
When using a relational database what makes data
formatting so important and critical to the functions...
asked 17 minutes ago -
The following temperatures show the (fictional) daily low
measured at O'Hare airport every January 1st from...
asked 37 minutes ago -
Your friend is interested in the characteristics of fast tree
planters. He searched through the records...
asked 44 minutes ago -
. 0.67 g of Ag is deposited electrolytically from
AgNO3 after a certain period of time...
asked 45 minutes ago -
assuming that the boric acid, h3po3 present at the end of the
borax tritation has a...
asked 44 minutes ago -
When a carbonate solution is acidified, carbon dioxide is
produced.
2H+(aq) + CO32-(aq) → H2O(l) +...
asked 1 hour ago -
A reaction has the following rate law: Rate =
kr[A][B]2. In experiment 1, the
concentrations of...
asked 1 hour ago -
king owns a large number of public pay phones. as rhe use of
payphones decline deamatically,...
asked 1 hour ago -
3.7 - A book is sitting on a table. The mass of the book
is 1...
asked 1 hour ago