Please help me with questions 1 and 2 void swap (int arr[], int i, int j){int temp = arr[i];arr[i] = arr[j];arr[j]}temp;void selectionSort (int arr[], int n){for (int i = 0; i < n 1; i++) {int min i;for (int j=i+1; j < n; j++) {if (arr[j] arr[min])min = j;swap (arr, min, i);}}}int main(){int arr[] = { 3, 5, 8, 4, 1, 9, -2 };int n = 7;selectionSort (arr, n);return 0;}1. Tranlaste the above C program to MIPS codes, suppose the starting address of codes is binarynumber 1000, the starting address of data is binary number 100000.2. Translate the first MIPS codes of "if (arr[j]

1):-The translation of the given C program into MIPS assembly language:# Data Section .data arr:…

Answered: void swap (int arr[], int i, int j) {…

New Perspectives on HTML5, CSS3, and JavaScript

6th Edition

ISBN:9781305503922

Author:Patrick M. Carey

Publisher:Patrick M. Carey

Chapter14: Exploring Object-based Programming: Designing An Online Poker

Section14.1: Visual Overview: Custom Objects, Properties, And Methods

Problem 7QC

See similar textbooks

Similar questions

package sorting; import java.util.Arrays; import java.util.Random; import sorting.Heap; public class ComparisonSorter { public static void insertionSort(int[] arr) { for(int i=1;i<arr.length;i++) { int j = i-1; int toPlace = arr[i]; while(j>=0&&arr[j]>toPlace) { arr[j+1] = arr[j]; j--; } arr[j+1] = toPlace; } } public static void mergeSort(int [] arr) { mergeSortRecurse(arr,0,arr.length-1); } private static void mergeSortRecurse(int[] arr, int start, int end) { if(start>=end) return; int mid = start + ((end-start)/2); mergeSortRecurse(arr,start,mid); mergeSortRecurse(arr,mid+1,end); merge(arr,start,mid,end); } private static void merge(int[] arr, int start, int mid, int end) { int leftSize = mid - start +1; int rightSize = end - mid; int[] left = new int[leftSize+1]; int[] right = new int[rightSize+1]; int leftIndex; int rightIndex; for(leftIndex = 0; leftIndex<leftSize;leftIndex++) left[leftIndex] = arr[start+leftIndex]; for(rightIndex = 0;…
/** Iluustration of RecursiveTask*/import java.util.concurrent.ExecutionException;import java.util.concurrent.ForkJoinPool;import java.util.concurrent.RecursiveTask; public class SumWithPool{ public static void main(String[] args) throws InterruptedException, ExecutionException { //get the number of avaialbe CPUs int nThreads = Runtime.getRuntime().availableProcessors(); System.out.println("Available CPUs: " + nThreads); //create an array of data int n = 10; //initital data size if(args.length > 0) // use the user given data size n = Integer.parseInt(args[0]); int[] numbers = new int[n]; for(int i = 0; i < numbers.length; i++) { numbers[i] = i; } ForkJoinPool forkJoinPool = new ForkJoinPool(nThreads); Sum s = new Sum(numbers,0,numbers.length); long startTime = System.currentTimeMillis(); //start timer Long result = forkJoinPool.invoke(s); long endTime =…
Write a Java program to implement sequential search. Create a String array in main method and initialize it with 5 different names. Now take any name from the user, find whether that name is present in that array or not, and print the position of that name in the array if found. Write a search method to sequentially search the name from the array. Invoke the search method from the main method. The array and the name to be searched should be passed into the search method as parameters. Sample input & output:[Let’s assume that the 5 names are Diana, Becker, Ann, Eve, and Cory]Enter the name: CoryThe name is found at 5th position.Enter the name: Donald The name is not found.Now write a Java program to implement binary search for the above problem. [Hint: You can use equals() and compareTo() methods of String class.]
Write a java program that fills in an array with up to 10 characters and then searches the array for a character entered by the user ( by using Binary Search Implemented by recursion ).
import java.util.ArrayList;import java.util.Random; class Main { public static void main(String[] args) { Random rand = new Random(); ArrayList<Integer> a = new ArrayList<Integer>(); for(int i = 0; i < 100; i++) { a.add(rand.nextInt(100)); } print(a); System.out.println("----"); sort(a); print(a); // simplified Quicksort public static void sort(ArrayList<Integer> a) { if (a.size() <= 1) return; // Pick a Pivot int m = a.size() / 2; int pivot = a.get(m); } ArrayList<Integer> smaller = new Arraylist<Integer>(); ArrayList<Integer> same = new ArrayList<Integer>(); ArrayList<Integer> larger = new ArrayList<Integer>(); for (Integer x : a) { if (x < pivot) { smaller.add(x); } else if(x > pivot) { larger.add(x); } else { same.add(x); } } sort(smaller); sort(larger); a.clear(); a.addAll(smaller);…
Write a complete Program in Java to implement circular queue using array for the following tasks: 1. Method to insert the new element in the circular queue 2. Method to delete an element from the circular queue 3. Method to display all the elements of the circular queue 4. Create the test class to perform the operations on circular queue in the following sequence: a. Add a new element 10 b. Add a new element 20 c. Add a new element 30 d. Add a new element 40 e. Display all elements f. Delete from the circular queue g. Delete from the circular queue h. Add a new element 50 i. Add a new element 60 j. Add a new element 70 Please screenshot of the output
public class Soru2 { static void sort(char a[]) { for(int i = 0; i < a.length; i++) { for(int j = i + 1; j < a.length; j++) { if(a[j] == 'X' && a[i] == 'O') { char temp = a[j]; a[j]=a[i]; a[i]=temp; } } } for(int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } } public static void main(String[] args) { char a[] = {'X','O','X','O','X','O','X','O','X','O'}; sort(a); } } Calculate the time complexity and number of steps of the algorithm?
The language used here is in Java. Please answer the question in the screenshot. Please use the code below as a base. Please only answer question 2. import java.util.*; class SortingPack { // just in case you need tis method for testing public static void main(String[] args) { // something } // implementation of insertion sort // parameters: int array unsortedArr // return: sorted int array public static int[] insertionSort(int[] unsortedArr) { // to be removed return unsortedArr; } // implementation of quick sort // parameters: int array unsortedArr // return: sorted int array public static int[] quickSort(int[] unsortedArr) { // to be removed return unsortedArr; } // implementation of merge sort // parameters: int array unsortedArr // return: sorted int array public static int[] mergeSort(int[] unsortedArr) { // to be removed return unsortedArr; } // you are welcome to add any supporting methods } import java.util.*; public class SortingTest{ public static void main(String[] args) {…
A list of int values can be defined recursively as: a list item, a comma, and a list, where a list item is any int value.
import java.util.*;class Arraylist{public static void main(String args[]){ArrayList obj = new ArrayList();obj.add("A");obj.add("B");obj.add("C");obj.add(1, "D");System.out.println(obj);}} What will the given code prints on the output screen.
implement QuickSort of ints that sorts the numbers in the non-decreasing order and in c language Implement the rearrange function used for QuickSort using the O(n) time algorithm with two pointers. The function gets as input an array, and index of the pivot. The function rearranges the array, and returns the index of the pivot after the rearrangement. please write form as: int rearrange(int* A, int n, int pivot_index); 2, Implement the QuickSort algorithm. For n<=2 the algorithm just sorts the (small) array (smaller number first). - For n>=3 the algorithm uses the rearrange function with the pivot chosen to be the median of A[0], A[n/2], A[n-1]. write as form: void quick_sort(int* A, int n);
Using recursion, write a Java program that creates an array of 10 numbers entered by the user. The recursive function receives the array and the position of the starting point of the array. The function returns the index of the smallest element of the array. The main method outputs the smallest of these numbers using the returned index.

SEE MORE QUESTIONS

Recommended textbooks for you

New Perspectives on HTML5, CSS3, and JavaScript

Computer Science

ISBN:

9781305503922

Author:

Patrick M. Carey

Publisher:

Cengage Learning

New Perspectives on HTML5, CSS3, and JavaScript

Computer Science

ISBN:

9781305503922

Author:

Patrick M. Carey

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS