Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7771179
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 1, 20262026-06-01T16:35:11+00:00 2026-06-01T16:35:11+00:00

i have to do a QuickSort to create an Array of Stonesmy question is:

  • 0

i have to do a QuickSort to create an Array of “Stones”my question is: i wanna make the QuickSort only over the “ValueySize” field witch is the result of “Value / Size” is there any way to get a sorted array of stones by valueYSize?

Thanks in advance 😉

public class Stone implements Comparable{

private float[] value;
private float[] size;
private float[] valueYSize;

}

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-01T16:35:12+00:00Added an answer on June 1, 2026 at 4:35 pm

    You can use the sort method from the Arrays class:

    float[] valueYSize       = //some operation......
    float[] sortedValueYSize = Arrays.sort(valueYSize);
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'd like to create various sorting classes (QuickSort, MergeSort, BucketSort...etc). I have a common
I need to create a random array of int and have it sorted by
I have a slight question about Quicksort. In the case where the minimun or
I have the following: function quickSort(array, low, high) { var len = array.length, l
I have been reading about Quicksort and found that sometimes it' s referred to
So I have been working on properly implementing a quicksort algorithm for a homework
I'm have a class with two methods, A QuickSort() and a ReverseArray(). When I
I finally finished a home-grown version of quicksort to sort an array of structures
I have written down the following program that uses the quicksort algorithm to sort
How are algorithms analyzed? What makes quicksort have an O(n^2) worst-case performance while merge

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.