Purchase Solution

Range Selection of Unsorted Array

Not what you're looking for?

Ask Custom Question

Write a method findRanks in Java that accepts an unsorted array of integers vals, and a starting and ending rank start and end, numbering ranks from 0, and returns an unsorted (any order is acceptable) array containing the lo-th through the hi-th elements, inclusive, of vals.

int[] findRanks(int[] vals, int lo, int hi)

For instance, if vals contains 10 elements as shown:

4 2 9 11 9 19 21 14 16 8

then the call findRanks(vals, 2, 5) will return an array containing the 3rd (remember we number from 0) through 6th items in vals (e.g. 8 9 11 9).

Purchase this Solution
Solution Summary

The range selection of unsorted arrays are determined. A method to write a findRanks in Java for an unsorted array are determined.

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

C# variables and classes

This quiz contains questions about C# classes and variables.

View More Free Quizzes
Related BrainMass Solutions

  • Java class creates an array of integers

    The Java class creates an array of integers. The program fills its values and prints the unsorted values.

  • Sorting in Java

    The element found is 80, exchange it with the head of the unsorted array which is element 15. The resulting array is 80 15 35 25 60 30 • Continue the previous process in the unsorted portion of the array which is now 15 35 25 60 30.

  • Decision tree for the insertion sort algorithm

    Draw the decision tree for the insertion sort algorithm for the following array of names: [Mickey, Minnie, Donald, Goofy]. 2. Create a program to implement the selection sort algorithm, which will sort a list of strings.

  • C++ code to implement SplitLists

    Implement SplitLists as an array-based member function of the Unsorted List ADT. b.

  • Java Method - removeAll

    136140 Java Method - removeAll Write a method, removeAll, that takes three parameters: an array of integers, the length of the array, and an integer, say, removeItem. The method should find and delete all occurrences of removeItem in the array.

  • Quick sort

    Unfortunately, if the array of values is sorted (or nearly sorted), the performance may go down to O(N^2) - due to the continuous scan of the pivot all the way to the other side of the array when the array is pre-sorted.

  • Data Structures Question

    (c) Describe and illustrate how items are normally added and removed from an efficient implementation of the queue ADT, as defined in class, which is implemented using an array.

  • Insertion Sort and Selection Sort Using C

    #include #include #include /** * Generates an array of random integers * * @param size the size of the integer array * @param range the range of the random integers generated * @return a pointer to the generated

  • Java Programming Calculator

    Write a method, removeAll, that takes three parameters: an array of integers, the length of the array, and an integer, say, removeItem. The method should find and delete all occurrences of removeItem in the array.

View More Related Solutions