Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. public ArrayList solution(ArrayList nums) { ArrayList finalList = new ArrayList<>(); int index = 0; for (int i = 0; i < nums.size(); i++) { if (nums.get(i) % 2 == 1) { finalList.add(index, nums.get(i)); index++; } else finalList.add(nums.get(i)); } return finalList; } This is my failing code. for [1.-3.3] where [1,3,-3] is being returned

Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. public ArrayList solution(ArrayList nums) { ArrayList finalList = new ArrayList<>(); int index = 0; for (int i = 0; i < nums.size(); i++) { if (nums.get(i) % 2 == 1) { finalList.add(index, nums.get(i)); index++; } else finalList.add(nums.get(i)); } return finalList; } This is my failing code. for [1.-3.3] where [1,3,-3] is being returned

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

void shiftLeft(int array[], int size, int& numUsed, int index) { index = array[0]; for(int i = 1; i <= size - 1; i++) { array[i - 1] = array[i]; } array[size-1] = index; } void shiftRight(int array[], int size, int& numUsed, int index) { index = array[numUsed-1]; for(int i = numUsed - 2; i >= 0; i--) { array[i + 1] = array[i]; } array[0] = index; } how do i fix my shift right function.
public int[] selectionSort(int[] array) {for (int i = 0; i < array.length - 1; i++) {int min = array[i];int minIndex = i;for (int j = i + 1; j < array.length; j++) {if (min > array[j]) {min = array[j];minIndex = j;}}if (minIndex == i) {array[minIndex] = array[i];array[i] = min;}}return array;}
PROBLEM STATEMENT: In this problem you will need to return the element from arandom position within the ArrayList. import java.util.ArrayList;public class RetrieveRandomElmFromArrList{public static Integer solution(ArrayList<Integer> arrList, int index){// ↓↓↓↓ your code goes here ↓↓↓↓return 0; Can you help me with this question The language is Java
What sort algorithm is implemented in the sortArray2 method in the following program segment? *
Declare an ArrayList of doubles that can store 100 receipts. ArrayList( double ) receipts = new ArrayList( double ); ArrayList( double ) receipts = new ArrayList( double, 100 ); ArrayList, double receipts = new ArrayList, double(); ArrayList receipts = new ArrayList(); ArrayList receipts = new ArrayList[ 100 ]; ArrayList receipts = new ArrayList[ 100 ]; ArrayList receipts = new double[ 100 ]; ArrayList[ double ] receipts = new double[ 100 ]; ArrayList[ double ] receipts;
class Student { public : int * grades ; Student ( int n ) { // dynamically allocate an array of grades of size n } ~Student ( ) { // delete the array of grades } };
a) FindMinIterative public int FindMin(int[] arr) { int x = arr[0]; for(int i = 1; i < arr.Length; i++) { if(arr[i]< x) x = arr[i]; } return x; } b) FindMinRecursive public int FindMin(int[] arr, int length) { if(length == 1) return arr[0]; return Math.Min(arr[length - 1], Find(arr, length - 1)); } What is the Big-O for this functions. Could you explain the recurisive more in details ?
public class ArrayMerge { static void arrayMerge(int a[], int b[]){ int c[] = new int[50]; int k = 0; for(int i = 0; i < a.length; i++) { c[k++] = a[i]; } for(int i = 0; i < b.length; i++) { c[k++] = b[i]; } for(int i = 0; i < k; i++) { System.out.println(c[i]); } } public static void main(String[] args) { int a[] = { 18, 36, 41, 78, 56 }; int b[] = { 10, 37, 44 }; arrayMerge(a,b); } } Calculate the algorithm step number and algorithm time complexity of the above program?
public static ArrayList findExactString(String s, ArrayList myArray) { return null; } // Use the above method, findExactString, as a helper method to implement addWithoutDuplication method. The addWithoutDuplication method has the following properties: 1- It takes two arguments, a string s and an ArrayList myArray of type string. 2- It returns an integer which represents the number of occurrences of the string s in myArray while attempting to add it. 3- If myArray is null, it returns -1 4- If adds the string s to the end of the ArrayList myArray if the string s is not already there. public static int addwithout Duplication(String s, ArrayList myArray) { return -1;
public class DynamicArray { private int array[]; private int count; private int size; public DynamicArray() { array = new int[1]; count = 0; size = 1; } public void add(int data) { if (count == size) { growSize(); // make array size double } array[count] = data; count++; } public void growSize() { int temp[] = null; if (count == size) { temp = new int[size * 2]; { for (int i = 0; i < size; i++) { temp[i] = array[i]; } } } array = temp; size = size * 2; } public void shrinkSize() { int temp[] = null; if (count > 0) { temp = new int[count]; for (int i = 0; i < count; i++) { temp[i] = array[i]; } size = count; array =…
the code: class HighArray { private long[] a; private int nElems; public HighArray(int max) { a = new long[max]; nElems = 0; } public void insert(long value) { a[nElems] = value; nElems++; } public boolean find(long searchKey) { int j; for (j = 0; j < nElems; j++) if (a[j] == searchKey) break; if (j == nElems) return false; else return true; } public long getMax() { if (nElems == 0) return 01; else { long max = a[0]; for (int i = 1; i < nElems; i++) { if (a[i] > max) max = a[i]; } return max; } } public boolean delete(long value) { int j; for (j = 0; j < nElems; j++) if (value == a[j]) break; if (j == nElems) return false; else { for (int k = j; k < nElems; k++) a[k] = a[k + 1]; nElems--; return true; } } public void display() { for (int j = 0; j < nElems; j++) System.out.print(a[j] + " "); System.out.println(""); }} public class HighArrayApp { public static void main(String[] args) { int maxSize =…
public class FindArrayDifference { static void arrayDifference(int a[], int b[]) { int k = 0; int [] c = new int[a.length]; for(int i=0; i < a.length; i++) { int j; for(j = 0; j < b.length; j++) if(a[i] == b[j]) break; if(j == b.length) c[k++] = a[i]; } for(int j = 0; j < k; j++) System.out.println(c[j]); } public static void main(String[] args) { int a[] = {1,2,3,7,8,15,26}; int b[] = {1,2,3,15,4,8,6}; arrayDifference(a,b); } } Calculate the algorithm step number and algorithm time complexity of the above program?