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

Similar Messages

Populate block with an sorted array contents.

hey,
i'm trying to populate a block (forms 10 vs. db 10g) with data from an array.
the data should be sorted.
what is the easiest way to do it?
another deatails (array structure)) will supplied if nessecary.
thanks , yair

How do you populate your array? If you populate it with a query in some way the easiest way would be not to use an array at all and simply populate the block with your query. This would spare you manually populating the block and implementing a sort algorithm yourself (just use order by)
If the data comes from what ever else source a pipelined function comes to my mind which would enable you to query your array with SQL and letting the SQL Engine do the sort. You'd just have to use a from-clause query on your block
http://docs.oracle.com/cd/B19306_01/appdev.102/b14289/dcitblfns.htm
cheers

Create a collection in the beforeshown by query sort by designer does not sort

In the beforeshown function of a screen, I create a collection. This collection will be displayed in my target screen. I have added in the designer a Sort order by the displayed screen does not conform to this sort.
Where is my error? The creation of the collection in the beforeshown function makes the query sort order execute before the collection is really created? Or the collection is not really database saved because it has been created in the beforeshown function?
In the case I must do the sort in the Created function of the target screen with something like
screen.StrengthCollection.setOrderBy()
But I do not know how to give the right parameter to setOrderBy...
Yves Pflieger

Hi,
You can try
To Bind a Query Parameter to a Field
1.Create a query that accepts a parameter (for example: the ID of a customer). For more information, see How to: Design a Query by Using the Query Designer.
2.Add the query to the Screen Content Tree. For more information, see How to: Design a Silverlight Screen by Using the Screen Designer.
3.Add a local field to the screen. For more information, see How to: Add a Local Property to a Silverlight Screen.
4.In the Screen Members List of the Screen Designer, select the parameter of the query.
5.On the View menu, click Properties Window.
6.Select the Parameter Value text box.
7.Select or type the name of the local field.
You can refer to article below:
https://msdn.microsoft.com/en-us/library/ff851987.aspx

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!"
§ (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.

URGENT - Does Select Query Sort based on RowId ?

Does Select Query Sort based on RowId ?
Eg: Select * from Employee;
RowId primkey name
aaaa 1 kiran
aaab 2 kumar
aaac 3 someone
Now when i delete the primkey: 2 row.
I will have:
RowId primkey name
aaaa 1 kiran
aaac 3 someone
Now when i insert a new record:
RowId primkey name
aaaa 1 kiran
aaac 3 someone
[Comment: Here the rowid can either be a new one like 'aaad' or 'aaab' is also reused.]
aaad 4 somename
My requirement is that the 'aaab' should not be reused.
Can any one pls suggest some way.

Dear Friend,
Plese gothrougth once following steps... (One by One)
Hope you can understand how Rowid Creating and Updting in you table.
SQL> select rowid,enumber from t;
ROWID ENUMBER
AAAJ4oAABAAAWlyAAA 1
AAAJ4oAABAAAWlyAAB 2
AAAJ4oAABAAAWlyAAC 3
AAAJ4oAABAAAWlyAAD 4
SQL> select rowid,enumber from t where enumber = 2;
1 row deleted.
SQL> insert into t values(9):
1 row created.
SQL> select rowid,enumber from t;
ROWID ENUMBER
AAAJ4oAABAAAWlyAAA 1
AAAJ4oAABAAAWlyAAC 3
AAAJ4oAABAAAWlyAAD 4
AAAJ4oAABAAAWlyAAE 9
SQL> delete from t where enumber = 3;
1 row deleted.
SQL> insert into t values(3);
1 row created.
SQL> select rowid,enumber from t;
ROWID ENUMBER
AAAJ4oAABAAAWlyAAA 1
AAAJ4oAABAAAWlyAAB 3
AAAJ4oAABAAAWlyAAD 4
AAAJ4oAABAAAWlyAAE 9
Regards,
G V Sreenivasulu

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.

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.

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.

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.

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?

Multiple columns from a query sorted vertically

Is it possible to sort a query resultset vertically, with
multiple columns across the page, in the following manner, with
page breaks after 40 rows? I can get it to sort horizontally just
fine with tables, but how can it be done vertically as shown?
JONES, Abby JONES, Betty JONES, Dawn JONES, Frank
JONES, Adam JONES, Bill JONES, Debbie JONES, Gayle
JONES, Alice JONES, Bob JONES, Denton JONES, Henry
JONES, Ben JONES, Cathy JONES, Emma JONES, John

This will get you started. I assume you had the appropriate
order by clause in your query. I also assume you want 4 columns per
line.
My approach would be to convert the query to an array and
then output the array.
columns = 4;
maxrows = 40;
recordsperpage = columns * rows;
records = query.recordcount;
myArray = ArrayNew(2);
ThisColumn = 1;
ThisRow = 1;
if (records gt recordsperpage)
LoopTill = recordsperpage;
else
LoopTill = records;
for ( ii = 1; ii lte LoopTill; ii = ii + 1){
myArray[ThisRow][ThisColumn] = query.field[ii];
increment ThisRow;
if (ThisRow = MaxRows + 1) {
ThisRow = 1;
increment ThisColumn;
} // if
} // looop
You can do the rest

Newbie query : sorting arrays

Similar Messages

Maybe you are looking for