Sort array

Hello to all,
I would like to ask you a question.
I need to sort an array of numbers and strings.
Can I sort the array by name?

I'm sorry, I explained I was wrong or inaccurate.
I enclose the table (array) I want to reorder.
Assuming that the column "Tratta" may have also different elements (not just Piacenza - Parma), I would be able to sort the table by clicking one of the elements of the columns (for example: sort the table by "Tratta" or by "Km", etc )
Attachments:
Tab.png ‏141 KB

Similar Messages

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.

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?

Sort Array of References by Label-Name

I am developing on an DSC application with shared variables and alarming and events with a hugh amount of variables. Each variable is displayed on the front panel within tab controls. To reduce time and effort when expanding the variables I would like to arrange my references from the front panel by the label name. I've attached a part of the intialization of the front panel. There I have to manually expand each variable in the shared variable library, where the name of the variable has to be in the same order as the definition in the cluster.
My approach was to build an array of references of digital type and sort the references by the label name. Because the shared variables have the same name as the controls they would be in the same order and I also could dislaim the cluster of references.
maybe somebody can give my an hint.
Kind Regards,
Joachim
Solved!
Go to Solution.
Attachments:
fp.jpg ‏982 KB

Hi Joachim,
use the standard "sort an array of cluster" approach!
Put the control label and the reference (in this order!) in a cluster, make an array of such clusters and sort the array. It will sort by the label and you can unbundle the reference in sorted order...
Best regards,
GerdW
CLAD, using 2009SP1 + LV2011SP1 + LV2014SP1 on WinXP+Win7+cRIO
Kudos are welcome

Sorting array not working when run as a job

I have a Powershell script that reads data from a log file, extracts a username and adds it to an array. I then sort the array to remove duplicates and export the data to a CSV file. The script works fine when run locally on the server but I need to call
the script remotely for a number of servers and when I do this it does not output anything to the CSV. The script is run as a job.
$ArrList = [System.Collections.ArrayList]@()
# open file and read data
$arrlist.Add("$final")
$arrlist | sort -unique | out-file c:\scripts\iis_users.csv
If I change the script to use add-content it can add entries to the same CSV file. But ideally I need to sort the output as there are many duplicates.

Not sure why but that would only export the last user. I didn't have time to investigate so instead I decided to only add users to the array after first checking they didn't exist already:
if ($arrlist -notcontains $final)
$arrlist.Add("$final")
add-content c:\scripts\iis_users.csv "$final"
I thought this would create a performance hit but it seems almost as fast.

How to Sort Array of Object

Hallo. I have an array of objects. Each object has id and name. How can i sort by name or by id??
Thx for all
Max

array.sortOn("name");

Difficult: Sort Array of Prices

Hi,
i want to sort this Array in a PL/SQL Procedure:
Price Start - Price End - Price Group
700 - 1200 - C
800 - 900 - B
1000 - 1200 B
1200 - 1300 A
1300 - 1700 C
1500 - 1600 B
Target:
700 - 800 C
800 - 900 B
900 - 1000 C
1000 - 1200 B
1200 - 1300 A
1300 - 1500 C
1500 - 1600 B
1600 - 1700 C
Can anybody help me.
Price Group A overwrite B overwright C
Message was edited by:
user645703
Message was edited by:
user645703
Message was edited by:
user645703
Message was edited by:
user645703
Message was edited by:
user645703

When i try
select price_start,price_end,
nvl(price_group,(select price_group
from (select 700 price_start,1200 price_end,'C' price_group from dual union all
select 800,900,'B' from dual union all
select 1000,1200,'B' from dual union all
select 1200,1300,'A' from dual union all
select 1300,1700,'C' from dual union all
select 1500,1600,'B' from dual
where i.price_start between price_start and price_end
and i.price_end between price_start and price_end
and i.price_group is null
) price_group
from (select the_starts,price_start,lead(price_start,1) over (order by the_starts) price_end,price_group
from (select a.the_starts,a.the_starts price_start,s.price_end,s.price_group
from (select price_start the_starts from (select 700 price_start,1200 price_end,'C' price_group from dual union all
select 800,900,'B' from dual union all
select 1000,1200,'B' from dual union all
select 1200,1300,'A' from dual union all
select 1300,1700,'C' from dual union all
select 1500,1600,'B' from dual
union
select price_end from (select 700 price_start,1200 price_end,'C' price_group from dual union all
select 800,900,'B' from dual union all
select 1000,1200,'B' from dual union all
select 1200,1300,'A' from dual union all
select 1300,1700,'C' from dual union all
select 1500,1600,'B' from dual
) a,(select 700 price_start,1200 price_end,'C' price_group from dual union all
select 800,900,'B' from dual union all
select 1000,1200,'B' from dual union all
select 1200,1300,'A' from dual union all
select 1300,1700,'C' from dual union all
select 1500,1600,'B' from dual
) s
where a.the_starts = s.price_start(+)
) i
where price_end is not null
Is it ok. But your code with subqueries work not :(

Sort Array of Foundtext as well as respective Page Number

Hi All,
I am a novice scripter. Also this is my first Indesign script. Please do help anyone for my first script. Following is my requirement.
I want to generate a particular character style applied text with belonging "Page Number". Also i need to Sort the found text alphabetically with belonging page number itself. I just generated the text as well as belonging page number by writing the following code.
var myDoc = app.activeDocument;
var myDocPath = app.activeDocument.filePath;
var myDocName = app.activeDocument.name;
app.findTextPreferences = null;
app.findTextPreferences.appliedCharacterStyle = myDoc.characterStyles.item("Test");
var myText = myDoc.findText();
var myPageNumber = new Array;
var myFoundText = new Array;
var myFoundTextSort = new Array;
for (var i = 0; i < myText.length; i++)
     myFoundText.push (myText[i].contents);
for (j = 0; j < myText.length; j++)
     var r = getPageFor(myText[j].characters[0]);
     myPageNumber.push ( r.name);
    var inc=0;
    var myLogFile = new File(myDocPath.fsName + "/Text_Report_" + app.activeDocument.name.split(".")[0] +".log");
    if(myLogFile.open("w", undefined, undefined))
        if(myFoundText.length!=0)
            for (var k=0; k<myFoundText.length; k++)
                serialno = k+1;
                myLogFile.writeln(" "+serialno+". "+myFoundText[k]+" --- Page " +myPageNumber[k]);
    myLogFile.close();
    myDoc.close();
function getPageFor (element)
     while (!(element instanceof Page || element instanceof Application))
          if (element instanceof Character)
               element = element.parentTextFrames[0].parent;
          else
               element = element.parent;
     if (element instanceof Page)
          return element;
     return null;
Please do help anyone. Thanks in advance

Hi John,
I tried using Array of Objects method given by you... I wrote like this...
var MYResults = MYDoc.findText();
var MYFoundText = new Array;
for (var i = 0; i < MYResults.length; i++)
    var r = getPageFor(MYResults[i].characters[0]);
    MYFoundText.push (MYResults[i].contents, r.name);
MYResults[i].contents --- For finding the Text
r.name ---- For finding the Page Number
I got the result like this:
1. greeking - "Character style applied text"
2. 1            - "Belonging Page Number"
3. reptamu
4. 1
5. molenis non
6. 2
7. doluptae
8. 3
9. ligendem
10. 4
11. Ab is quunto
12. 5
If it comes in a same line, i can easily sort alphabetically.
Please do help me.
Many thanks for your help.

Sort array

Similar Messages

Maybe you are looking for