Sort array method...

Hi all,
I have a float array of many rows and two columns.
I was wondering whether it is possible to sort this array with calls of java api, just be specifing the column index number.
Thank you.

That works with Arrays.sort and Comparator
import java.util.*;
class FloatArray {
public static void main(String[] args){
Random rand=new Random();
float[][] floatArray=new float[10][2];
// filling the array with random numbers
for(int i=0; i<10; i++)
    for(int j=0; j<2; j++) {
        floatArray[i][j]=rand.nextFloat();
// sorting the first column
Arrays.sort(floatArray, new Comparator<float[]>() {
    public int compare(float[] f1, float[] f2)  {
        if (f1[0]>f2[0]) return 1;
        else if (f1[0]==f2[0]) return 0;
        else return -1;
for(int i=0; i<10; i++) {
    for(int j=0; j<2; j++) {
        System.out.print(floatArray[i][j]+", ");
    System.out.println();
System.out.println();
System.out.println();
// sorting the second column
Arrays.sort(floatArray, new Comparator<float[]>() {
    public int compare(float[] f1, float[] f2)  {
        if (f1[1]>f2[1]) return 1;
        else if (f1[1]==f2[1]) return 0;
        else return -1;
for(int i=0; i<10; i++) {
    for(int j=0; j<2; j++) {
        System.out.print(floatArray[i][j]+", ");
    System.out.println();
}

Similar Messages

  • I need help on a sorting array method()

    I'm working on a program that can do a calculation for a swimming event where there will be no more than 200 paticipants. The swimmers that signed up first for the race will be swimming in the last heat.They swim in a pool with 7 lines.The swimmer that signed up first ( and so has the lowest sign up time)swimms in line 4,the swimmer that signed up second ( and so has the second lowest sign up time)swimms in line 5, and the swimmer that signed up after that in line 3.
    Which meens that the lines are filled as follow:
    line 1 time 7
    line 2 time 5
    line 3 time 3
    line 4 time 1
    line 5 time 2
    line 6 time 4
    line 7 time 6
    When the last heat is filled, the heat before the last one is filled after the same pattern and so on, so that the first heat is filled last.
    Now, I have written a class that can sort the times from the lowest to the highest, but how do I write a method that can sort the swimmers into the heats and the right lines??
    public class SwimmingEvent
    private String name;
    private int birthYear;
    private int number;
    private double signUpTime;
    private Swimmer[] record;
    private int numberOfSwimmers;
    public SwimmingEvent()
    name = "No record";
    birthYear = "No record";
    number = "No record";
    signUpTime = 0;
    public SwimmingEvent(String initialName, int initialBirthYear,
    int initialNumber, double initialSignUpTime)
    set(initialName, initialBirthYear, initialNumber, initialSignUpTime);
    public void set(String newName, int newBirthYear, int newNumber, double newSignUpTime)
    name = newName;
    birthYear = newBirthYear;
    number = newNumber;
    signUpTime = newSignUpTime;
    public void readInput()
    System.out.print("Indtast sv�mmerns navn:");
    name = SavitchIn.readLine();
    System.out.print("Indtast �rgang:");
    birthYear = Savitch.readLine();
    System.out.print("Indtast l�bsnummer:");
    number = SavitchIn.readLine();
    System.out.print("Indtast tid for anmeldelse:");
    signUpTime = SavitchIn.readLineDouble();
    public void getFigures()
    System.out.println("Indtast antalet af sv�mmer:");
    numberOfSwimmers = Savitch.readLineInt();
    record = new Swimmer[numberOfSwimmers];
    int i;
    for (i = 0; i < numberOfSwimmers; i++)
    record[i] = new Swimmer();
    System.out.println("Indtast data for sv�mmer: " + (i+1));
    record.readInput();
    System.out.println();
    public static void sort(double[] a)
    int index, indexOfNextSmallest;
    for (index = 0; index < a.length - 1; index++);
    indexOfSmallestNumber = indexOfSmallest(index, a);
    interchange(index, indexOfNextSmallest, a);
    private static void interchange(int i, int j, int[] a)
    int temp = a[i];
    temp = a[i];
    a[i] = a[j] = temp;
    private static int indexOfSmallest(int startIndex, int[] a)
    int min = a[startIndex];
    int indexOfMin = startIndex;
    int index;
    for (index = startIndex + 1; index < a.length; index++)
    if (a[index] < min)
    min = a[index];
    indexOfMin = index;
    return indexOfMin;
    public void writeOutput()
    public String getName()
    return name;
    public int getBirthYear()
    return birthYear;
    public int getNumber()
    return number;
    public double getSignUpTime()
    return signUpTime;

    Now, I have written a class that can sort the times from the lowest to
    the highest, but how do I write a method that can sort the swimmers into
    the heats and the right lines??Once you have a working general sort algorithm, issues like this come down to how you make your comparisons between elements. So what you want to do is write your sort code so that the comparison code is modular. (for example, using a class to express comparisons, so you can swap out comparison classes). Then whatever your requirements for sorting elements are, you can achieve them by writing the right comparison code and leaving your sort alone.
    This is how Java's core libraries do it, by the way. See:
    http://java.sun.com/j2se/1.4.1/docs/api/java/util/Comparator.html
    I'm assuming this is your homework. If it's not, then you shouldn't be writing your own sort routines -- use the ones java provides. See the API.

  • Sun C++ std::sort coredump during sorting array of long values

    Hello,
    I got core dump during execution following test program on both Solaris 9 (compile by CC: Sun C++ 5.5 Patch 113817-19 2006/10/13) and Solaris 10 platforms (compile by CC: Sun C++ 5.9 SunOS_sparc Patch 124863-01 2007/07/25).
    Core is dumped during sorting array of about 120k elements of unsigned long types using STL std:sort. The input data is available at link: [file.txt|http://www.savefile.com/files/1924004]
    When I change sorting methods to std::stable_sort program works fine.
    The funny thing is that when I change order of last two values of input data (swap), sorting is successful with std::sort.
    Can anyone tell me if it is Sun C++ compiler bug ?Can I use std::stable_sort method safely?
    Below code:
    #include <iostream.h>
    #include <fstream.h>
    #include <set>
    #include <string>
    int main( int argc, char** argv )
      char readStr[256];
      ifstream file;
      unsigned long *l;
      int i=0;
      l = new unsigned long[119016];
      if (l ==0)
        cout << "Error in allocate memory";
        return -1;
      file.open("file.txt");
      if (!file)
        cout << "Error in openening file";
        return -1;
      while(file.getline(readStr, 256,'\n'))
        cout << readStr<<endl;
        l= atol(readStr);
    cout << l[i]<<endl;
    i++;
    std::sort(l,l+119016); //core dump here!!!
    for (i=0;i<119016;i++)
    cout <<l[i]<<endl;
    file.close();
    delete [] l;
    return( 0 );
    Greetings
    Robert                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   

    You have run into bug 6588033 "std::sort from libCstd loops", which is fixed in current patches.
    Get the current patches for Sun Studio and also the current patch for the C++ runtime libraries (SUNWlibC patch).
    You can find them here:
    [http://developers.sun.com/sunstudio/downloads/patches/index.jsp]
    Sun C++ 5.5 probably does not have the fix, since it is quite old and falling out of support.
    C++ 5.9 does have the fix.

  • Sorting array vs sorting paginated array

    ...pulling in a long list of photos in a gallery, and I have
    a sort function working within the pages of data fine. I need to
    bring it back out of the paging stuff so that it sorts the data,
    THEN passes to the paging function.
    My data comes from mysql > php > xml > Flex into an
    ArrayCollection, referred to in MXML as {acSlides}.
    Pass the array collection to the paging system like:
    <utils:FXCPager id="fxcPager" pageIndex="{currentPage}"
    pageSize="{pageSize}" dataProvider="{acSlides}" />
    then assign in repeater:
    <mx:Repeater id="slideRepeater"
    dataProvider="{fxcPager.pageData}">...</>
    There is a button for sorting that calls a function a la:
    private function sortByRating():void {
    var sort:Sort = new Sort();
    sort.fields = [new SortField("rating",false,true)];
    fxcPager.pageData.sort = sort;
    toggleRating = false;
    fxcPager.pageData.refresh();
    What do I need to do to get this sort function to work on the
    {acSlides} array collection instead of {fxcPager.pageData} ???
    Thanks!

    OK I have resolved the error by importing the class adGroup. However now I am back to the original problem which is how to sort the DisplayName alphabetically and keep the associated link in tact. I created the class to avoid sorting parellel arrays but I am afraid it solved nothing as I have no idea how to sort the class. I tried just sorting it like an array:
      Arrays.sort(bAD.getGroups()but receive the following error:
    java.lang.ClassCastException: com.mylbean.adGroup incompatible with java.lang.Comparable
    at java.util.Arrays.mergeSort(Arrays.java:1160)
    at java.util.Arrays.sort(Arrays.java:1131)
    >
    I would assume this message is caused because I cannot sort a class array using this method. But being newer to Java I really have no idea how to get the class to sort by DisplayName before displaying to the user.
    So at this point the code works fine but how do I display alphabetically? All suggestions are appreciated.

  • Newbie query : sorting arrays

    I have an array defined as
    textBook [ ] tbk = {"book23","book14","book6","book40","book36"}which is storing values of textBook type.
    I have to sort this array into an ascending order as
    tbk = {"book6","book14","book23","book36","book40"}I tried using the Arrays.sort(Object [ ]) method .. but it does not work on user defined objects ... can anyone please give me a hint or two on doing it ... thanks in advance

    I have an array defined as
    textBook [ ] tbk =
    {"book23","book14","book6","book40","book36"}
    No, that won't work. That's an array of String.
    I tried using the Arrays.sort(Object [ ]) method ..
    but it does not work on user defined objectsYes it does. But that class has to implement Comparable. (Or you may be able to supply a Comparator.)
    http://java.sun.com/docs/books/tutorial/collections/interfaces/order.html
    http://www.javaworld.com/javaworld/jw-12-2002/jw-1227-sort.html

  • CompareTo and Sorting Arrays

    I am trying to sort an array of telephone directory information by last, first names, but am having trouble understanding how to use the compareTo method to do so. I thought I could use Arrays.sort, but this doesn't seem to work....any help would be appreciated.
    public static Person [] sort(Person [] people) {
    Person [] sorted = Arrays.sort(people);
    return (Person[])sorted.toArray(new Person[sorted.size()]);
    }/* end sort method */
    //From Person class
    public int compareTo(Object o) {
    Person p = (Person)o;
    int temp;
    if((temp=getLastName().compareTo(p.getLastName())) == 0)
    if((temp=getFirstName().compareTo(p.getFirstName())) == 0)
    //not sure what to do here
    return temp;
    }

    You want to return a negative or positive or zero integer if this item is less than, greater than, or the same as, the object passed as an argument, right? (Read the API.)
    You're trying to sort by last name first, and if they're the same, then the first name, right?
    So you're not really checking for zero, you're checking for non-zero.
    I'm assuming that first name and last name are given by strings, which implements Comparable. So you can do:
    public int compareTo(Object o) {
      Person p = (Person)o;
      int temp = getLastName().compareTo(p.getLastName());
      if (temp != 0)
        return temp;
      // implicit else here
      // MORE CODE GOES HERE
    }I'll let you do the "MORE CODE GOES HERE" as an exercise.
    BTW if you're implementing Comparable, you should probably be overriding equals() as well.

  • Removes duplicates from a sorted array without having to create a new array

    Funcation removes duplicates from a sorted array without having to create a new array

    Funcation removes duplicates from a sorted array
    without having to create a new arrayIs a 'funcation' like a vacation but more fun or
    something?LMFAO. You just jumped with both feet on one of my biggest peeves. I've been outed!
    Actual words/phrases I've seen used which I hate with every fiber of my being:
    "Mrs. Freshly's"
    "McFlurry"
    "Freshissimo"
    "Spee-dee"
    "Moons Over My Hammy"
    One of my favorite SNL skits had Will Ferrell leading a panel of movie reviewers (they're the worst for this kind of junk). Each one had some cheesy pun to describe their respective movie. Ferrell topped the show off with his endorsement of "Fantasia 2000 is Fantasgreat!"
    LOL.
    "Come to Slippy Village - it's a FUNCATION!"
    &#167; (runs off, laughing maniacally, head explodes)

  • Exception handling in sorting arrays

    Hi all, I have a problem with the use of the built in java sort fo arrays. My program works on an array with 4 or 5 entities. When I run it in some folders it works but not in others. I get the following error after compilation, where "ResultData" is the class of array to be sorted:Exception in thread "main" java.lang.NullPointerException
    at ResultData.compareTo(TextEdit.java:1215)
    at java.util.Arrays.mergeSort(Arrays.java:1064)
    at java.util.Arrays.mergeSort(Arrays.java:1071)
    at java.util.Arrays.mergeSort(Arrays.java:1072)
    at java.util.Arrays.mergeSort(Arrays.java:1071)
    at java.util.Arrays.mergeSort(Arrays.java:1071)
    at java.util.Arrays.mergeSort(Arrays.java:1071)
    at java.util.Arrays.sort(Arrays.java:1014)
    at java.util.Collections.sort(Collections.java:78)
    [\code]Can any one give a suggestion?                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   

    Here is the code for the class "ResultData"class ResultData implements Comparable
         String file1;
         String file2;
         double var, var1, var2;
         public ResultData(String f1,String f2,double v, double x, double y)
                   file1= f1; file2=f2;
                   var=v; var1=x; var2=y;
         public String getFile1Name()
              return file1;
         public String getFile2Name()
              return file2;
         public double getVar()
              return var;
         public double getVar1()
              return var1;
         public double getVar2()
              return var2;
         public String toString()
              return file1+"          "+file2+"          "+var+"          "+var1+"          "+var2;
           public int compareTo(Object o)
              ResultData r= (ResultData)o;
              double result = this.getVar()- r.getVar();
              if (result < 0.0)         return -1;
              else if(result > 0.0)     return 1;
              else return 0;
    } // ends class ResultData

  • TreeSet vs Collection.Sort / Array.sort for Strings

    Gurus
    I am pondering weather to use TreeSet vs the Collections.sort / Array.sort for sorting Strings.
    Basically I have a list of Strings, i need to perform the following operations on these Strings
    1) Able to list Strings starting with a Prefix
    2) Able to list Strings Lexically greater than a String
    Any help would be greatly appreciated!
    Thanks a bunch

    SpaceShuttle wrote:
    Gurus
    I am pondering weather to use TreeSet vs the Collections.sort / Array.sort for sorting Strings.
    Basically I have a list of Strings, i need to perform the following operations on these Strings
    1) Able to list Strings starting with a Prefix
    2) Able to list Strings Lexically greater than a String
    Any help would be greatly appreciated!
    Thanks a bunchBig-O wise, there's no difference between sorting a list of N elements or inserting them one by one in a tree-set. Both take O(n*log(n)). But both collections are not well suited for looking up string that start with a certain substring. In that case you had better use a Patricia tree (or Radix tree).
    Good luck.

  • I need sorting VI that returns the sorted array element's positions in the unsorted array

    I need a VI that will very quickly (n log n) sort a 1D array of doubles.  This VI should not only output the sorted array, but for each of the sorted array elements, it should also output that sorted array element's position in the unsorted array.  So for example if the input array were:
    unsorted_array
    4.1
    2.3
    7.0
    5.6
    10.2
    Then the output arrays would be:
    sorted_array
    2.3
    4.1
    5.6
    7.0
    10.2
    indices_array
    1 (the value 2.3 is located at position 1 in the unsorted_array)
    0 (the value 4.1 is located at position 0 in the unsorted_array)
    3 (the value 5.6 is located at position 3 in the unsorted_array)
    2 (the value 7.0 is located at position 2 in the unsorted_array)
    4 (the value 10.2 is located at position 4 in the unsorted_array)
    This way I could generate the sorted_array using just the indices_array and the unsorted_array.  Has anyone written a nifty piece of code to do this?  I did some research on (n log n) sorting algorithms but most of them use recursion which I don't know how to do in LabVIEW.  It would also be nice to have an algorithm like this that could sort an array of strings.
    cheers,
    Richard

    Try something like the attached example (LabVIEW 7.0). I think it does what you need.
    (To understand the code, it is important to know that arrays of clusters are sorted by the first element in the cluster).
    Sort array itself sorts also array of strings, so you could just substitute, keeping the rest of the code the same.
    Sort array uses a variation of quicksort, so it should have about NlogN complexity.
    (If you think you only need the array of indices to later generate the sorted array, it does not make much sense to even do it. To get the indices, you need to sort the array anyway. You should just sort the plain array directly.
    Message Edited by altenbach on 07-13-2005 03:47 PM
    LabVIEW Champion . Do more with less code and in less time .
    Attachments:
    SortAndIndex.vi ‏26 KB

  • Sorting array

    I know how to sort the array of strings alpha numerically but my problem is that the numerical values will not follow there corresponding strings
    here is the code i am using:
    Harold Timmis
    [email protected]
    Orlando,Fl
    *Kudos always welcome
    Solved!
    Go to Solution.
    Attachments:
    testingfileIO.vi ‏35 KB

    Hi.
    It's nice to have "sorting array" icon.
    But I have problem with programming similar option. I want to sort my sine samples taken in more periods to just one period.
    Beside defining that mycurrent sample should be less than next one, and greater from previous one in one case, I should take in consider that derivation could be positive or negative. While negative derivation, next sample should be less then current and so one.
    Can someone help me with programming?
    I've extracted the first period, and then I have to go trough each sample and compare him. When logic is well,I get the index and putinsert elemt in array.
    I think that I'm having problem with while loops. I don't know where to put them.
    I'm attaching VI. beacuse I'm working on Labview 9.0, I'm attaching also a pic.
    Thanks in advance.
    Attachments:
    resampling.vi ‏89 KB
    Untitled.jpg ‏135 KB

  • Sorting array list

    can u please give me the source code for:
    sorting array list for ascending and descending order

    You already have the source code.

  • Index of sorted array

    I have a unsorted array as follows:
    array_index = {0 1 2 3 4 5 6 7 8}
    array = {1 2 4 3 4 3 4 2 1}
    I would like to get the previous index of sorted array as follows:
    old_index = {2 4 6 3 5 1 7 0 8}
    arrray.sort doesn't return the index the previous index, please help me.

    You can do that using by creating an array containing the numbers 0 to n in increasing order and sorting that using a comparator that actually compares the content of the original array at the indices provided to it instead of the values themselves.
    But why would you need that? Could you describe your requirement in a broader scope?

  • Methods, sorting, array

    write and test a method that takes a two dimensional integer array as an argument and returns atwo dimensional integer array where the elements of each column are sorted into acsending order..the method should not to affect the two dimensional argument array being passed as an actual argument.method should cope with any size of an array
    quite confuse with this ..help me

    A study of this would help
    A. Arrays
    1.What are arrays
    2.What are 2 dimensional arrays
    B. Functions
    1. Know what is functions
    2.Learn how to create them
    3.what is parameters
    4.What are function returns
    5.And the most importantly, study the kinds of parameter passing
    Update me with this stuff
    ganbatte ne!!!

  • Java.util.Arrays; (method sort( ) )

    1) How to change a direction of sorting (on increase / on decrease)?
    2) Whether exists in java 2 something similar for sorting Strings ?

    1) How to change a direction of sorting (on increase
    / on decrease)?[url http://java.sun.com/j2se/1.5.0/docs/api/java/util/Collections.html#reverseOrder()]http://java.sun.com/j2se/1.5.0/docs/api/java/util/Collections.html#reverseOrder()
    2) Whether exists in java 2 something similar for
    sorting Strings ?Arrays.sort and Collections.sort will both sort the array or list as long as the type implements Comparable (or you supply a separate Comparator). Since String implements Comparable, those sort methods will sort the array or list of strings.
    Making Java Objects Comparable
    http://java.sun.com/docs/books/tutorial/collections/interfaces/order.html
    http://www.javaworld.com/javaworld/jw-12-2002/jw-1227-sort.html

Maybe you are looking for