Sort an String Array

Im having trouble sorting an Array. Before i add my new post to a[0] I would like to push all values one step. So value of a[0] will be stored in a[1] and value of [1] will be stored in [2] before a[0] = new value.
I haven found a way yet, anyone else?
Sebastian Green

Hmm, I worked my own way of handle it. Like this:
for (int i=4; i >= 0 ; i--) {
               if (i==0){
                    a[i] = getNewData();
               } else {
                    a[i] = a[i-1];
             }Which one is best? I could set the "int=4" dynamiclly . But why should I use Vector? I thought that it would be better with a String[]. Then I have set the amount of memory to use for my Array? Or is is better to store it in an Vector and call New Vector () every round so the size dosent get large then it has to?

Similar Messages

Newbie trying to sort 2D string array

Dear all,
After read some book chapters, web sites including this, I still don't get the point.
If I have a file like,
1 aaa 213 0.9
3 cbb 514 0.1
2 abc 219 1.3
9 bbc 417 10.4
8 dee 887 2.1
9 bba 111 7.1
and I load into memory as a String[][]
here comes the problem, I sort by column 1 (aaa,...,bba) using an adaptation of the Quicksort algorithm for 2D arrays
* Sort for a 2D String array
* @param a an String 2D array
* @param column column to be sort
public static void sort(String[][] a, int column) throws Exception {
QuickSort(a, 0, a.length - 1, column);
/** Sort elements using QuickSort algorithm
static void QuickSort(String[][] a, int lo0, int hi0, int column) throws Exception {
int lo = lo0;
int hi = hi0;
int mid;
String mitad;
if ( hi0 > lo0) {
/* Arbitrarily establishing partition element as the midpoint of
* the array.
mid = ( lo0 + hi0 ) / 2 ;
mitad = a[mid][column];
// loop through the array until indices cross
while( lo <= hi ) {
/* find the first element that is greater than or equal to
* the partition element starting from the left Index.
while( ( lo < hi0 ) && ( a[lo][column].compareTo(mitad)<0))
++lo;
/* find an element that is smaller than or equal to
* the partition element starting from the right Index.
while( ( hi > lo0 ) && ( a[hi][column].compareTo(mitad)>0))
--hi;
// if the indexes have not crossed, swap
if( lo <= hi )
swap(a, lo, hi);
++lo;
--hi;
/* If the right index has not reached the left side of array
* must now sort the left partition.
if( lo0 < hi )
QuickSort( a, lo0, hi, column );
/* If the left index has not reached the right side of array
* must now sort the right partition.
if( lo < hi0 )
QuickSort( a, lo, hi0, column );
* swap 2D String column
private static void swap(String[][] array, int k1, int k2){
String[] temp = array[k1];
array[k1] = array[k2];
array[k2] = temp;
----- end of the code --------
if I call this from the main module like this
import MyUtil.*;
public class kaka
public static void main(String[] args) throws Exception
String[][]a = MyUtil.fileToArray("array.txt");
MyMatrix.printf(a);
System.out.println("");
MyMatrix.sort(a,1);
MyMatrix.printf(a);
System.out.println("");
MyMatrix.sort(a,3);
MyMatrix.printf(a);
for the first sorting I get
1 aaa 213 0.9
2 abc 219 1.3
9 bba 111 7.1
9 bbc 417 10.4
3 cbb 514 0.1
8 dee 887 2.1
(lexicographic)
but for the second one (column 3) I get
3 cbb 514 0.1
1 aaa 213 0.9
2 abc 219 1.3
9 bbc 417 10.4
8 dee 887 2.1
9 bba 111 7.1
this is not the order I want to apply to this sorting, I would like to create my own one. but or I can't or I don't know how to use a comparator on this case.
I don't know if I am rediscovering the wheel with my (Sort String[][], but I think that has be an easy way to sort arrays of arrays better than this one.
I've been trying to understand the Question of the week 106 (http://developer.java.sun.com/developer/qow/archive/106/) that sounds similar, and perfect for my case. But I don't know how to pass my arrays values to the class Fred().
Any help will be deeply appreciated
Thanks for your help and your attention
Pedro

public class StringArrayComparator implements Comparator {
int sortColumn = 0;
public int setSortColumn(c) { sortColumn = c; }
public int compareTo(Object o1, Object o2) {
    if (o1 == null && o2 == null)
      return 0;
    if (o1 == null)
      return -1;
    if (o2 == null)
      return 1;
    String[] s1 = (String[])o1;
    String[] s2 = (String[])o2;
    // I assume the elements at position sortColumn is
    // not null nor out of bounds.
    return s1[sortColumn].compareTo(s2[sortColumn]);
// Then you can use this to sort the 2D array:
Comparator comparator = new StringArrayComparator();
comparator.setSortColumn(0); // sort by first column
String[][] array = ...
Arrays.sort(array, comparator);I haven't tested the code, so there might be some compiler errors, or an error in the logic.

Sorting 2D string array

Hi I am new to labview. I want to sort my 2D string array by col 1. But I dont know how to sort it perfectly. My sorted array will be something like this.
Col 1
A1
A2
A3
A4
A5
A6
A7
A8
A9
A10
A11

duplicate, see: http://forums.ni.com/ni/board/message?board.id=170&thread.id=317581&jump=true
LabVIEW Champion . Do more with less code and in less time .

Sorting a String Array in alpha order (Using ArrayList)

Hello all!
I am pretty new to Java and am trying to do a, seemingly, simple task; but cannot get the syntax right. I am trying to sort an ArrayList in aplha order based off of the variable String Product. Any help would be awesome!
First Class:
//This program stores all of the variables for use in Inventory.java
public class Vars {
     // defining all variables
     private String product;
     private String prodCode;
     private double price;
     private double invCount;
     // Begin listing getters for class
     public Vars(String product) {
          this.product = product;
     public String getProdCode() {
          return prodCode;
     public String getProduct() {
          return product;
     public double getPrice() {
          return price;
     public double getInvCount() {
          return invCount;
     // Declaring the total variable
     public double total() {
          return invCount * price;
     // Begin listing setters for variables
     public void setProduct(String product) {
          this.product = product;
     public void setProdCode(String prodCode) {
          this.prodCode = prodCode;
     public void setInvCount(double invCount) {
          this.invCount = invCount;
     public void setPrice(double price) {
          this.price = price;
Second Class:
//This program will use the variables stored in Vars.java
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Inventory {
     public static void main(String args[]) {
          Scanner input = new Scanner(System.in);
          //defining and declaring local variables
          String exit;
          int counter;
          double gtotal;
          exit = "exit";
          counter = 0;
          gtotal = 0;
          //beginning message and beginning of the loop
          System.out.print("Welcome to the Inventory Contol System\nPlease enter the Product name: ");
          System.out.println();
          System.out.println("When finished entering in the data, please enter EXIT in place of Product name.");
          String name = input.next();
          List<Vars> var = new ArrayList<Vars>(); //creating arraylist object
          //loop while exit is not entered, exit loop once exit is typed into product variable
          while (name.compareToIgnoreCase(exit) != 0) {
               Vars vars = new Vars(name); //calling Vars methods
               counter = counter ++;
               System.out.println("Please enter the Product Code: ");
               vars.setProdCode(input.next());
               System.out.println("Inventory Count: ");
               vars.setInvCount(input.nextDouble());
               //Making sure that the value entered is a positive one
               if(vars.getInvCount() < 0){
                    System.out.println("Please enter a positive number: ");
                    vars.setInvCount(input.nextDouble());
               System.out.println("Price per product:");
               vars.setPrice(input.nextDouble());
               //Making sure that the value entered is a positive one
               if(vars.getPrice() < 0) {
                    System.out.println("Please enter a positive number: ");
                    vars.setPrice(input.nextDouble());
               System.out.println("Please enter the next Product name, or enter EXIT: ");
               name = input.next();
               gtotal += vars.total(); //calculation for Grand Total of all products entered
               var.add(vars);
               static void slectionSort(int[] product) {
               for (int lastPlace = product.length-1; lastPlace > 0; lastPlace--) {
               int maxLoc = 0;
               for (int j = 1; j <= lastPlace; j++) {
               if (product[j] > product[maxLoc]) {
               maxLoc = j;
               int temp = product[maxLoc];
               product[maxLoc] = product[lastPlace];
               product[lastPlace] = temp;
          //Sorting loop function will go here, before the information is displayed
          //Exit message and array list headers
          System.out.print("Thank you for using the Inventory program.\nHave a wonderful day.\n");
          System.out.printf("Code\tProduct\tCount\tPrice\tTotal\n");
          System.out.println();
          //For loop to display all entries via an ArrayList
          for (Vars vars : var) {
               System.out.printf("%5s\t%5s\t%.01f\t$%.02f\t$%.02f\n\n", vars.getProdCode(),
                         vars.getProduct(), vars.getInvCount(), vars.getPrice(),vars.total());
          //Displays the amount of entries made and Grand Total of all products entered
          System.out.println();
          System.out.printf("The number of products entered is %d\n", var.size());
          System.out.printf("The Grand Total cost for the products entered is $ %s\n", gtotal);
          System.out.println();
}

go through below links, you can easily understand how to sort lists.
http://www.onjava.com/lpt/a/3286
http://java.sun.com/docs/books/tutorial/collections/interfaces/order.html
http://www.javaworld.com/javaworld/jw-12-2002/jw-1227-sort.html

String Array Sorting

Question 1. Anybody know how to easily sort a string array?
Question 2. Is there any good data base management VI's out there anywhere?
Thank you

> Question 1. Anybody know how to easily sort a string array?
>
There is this icon in the Array palette called Sort 1D Array. You might want
to give it a try.
> Question 2. Is there any good data base management VI's out there anywhere?
>
There may be some freebie stuff floating around, but I know that NI has
an SQL add-on for communicating with most standard databases. As mentioned
in a previous posting this morning, you can also use ActiveX if that is
more convenient/easier for you. From my experience, most people find the
SQL approach easier once they get past the three letter acronym.
Greg McKaskle

Sort String Array by Date

I use the following code to populate a string array:
File dirFile = new File("C:\\somedir");
String fileImport[] = dirFile.list();
This gives me a string array with a whole bunch of files in the following format:
XXXDDMMYYHHMISS.xml
What I need to know is what is the easiest way to sort this array based on this date format, or any date format, in the ascending order, so that when I am loading my XML files, I get the oldest one first.
Appreciate any input.
Sam

Use the String name of the file (the Date part), together with a java.text.SimpleDateFormat object to parse() the String. You have to set the formatter with a pattern - these are explained fully in the Javadocs for the SimpleDateFormat class. After parsing, you will have java.util.Date objects for each of the files - you can then use these as keys in a java.util.SortedMap (the values would be the files) - the natural ordering of dates will ensure that they are ordered appropriately

Simpler way to sort 2-d string array?

I have a long 2d string array, and I would like to sort by the 2nd value. It originates as:
    public static final String names[][] = {
     {"000000", "Black"},
     {"000080", "Navy Blue"},
     {"0000C8", "Dark Blue"},
     {"0000FF", "Blue"},
        {"000741", "Stratos"},
     {"FFFFF0", "Ivory"},
     {"FFFFFF", "White"}
    };As you can see, they are pre-sorted by the hex values. That is useful for part of the app.
There are 1,567 entries. I would like to alphabetize the color names and place them in a list widget. I need to keep the associated hex color values with the name values. All I can think of to do something like:
1) make a temporary long 1-d string array
2) fill it by loop that appends the hex values to the name values: temp[i] = new String (names[1] + names[i][0])
3) sort temp[] with built in Java sort
4) make a permanent new string array, hexValues[] for the hex values
5) copy the last 6 characters of each item to hexValues[]
6) truncate the last 6 characters of each item in temp[]
7) build list widget with temp[]
Is there a more elegant way? What I'd really like to do is build a 1-d array of int's, with the values representing the alphabetized locations of the names. However, I don't see any built-in which would do that kind of indirect sort.
Second question -- Can the backgrounds of each item in a list widget be a different color? Ideally the list would show the color name in black or white, and the its color value as background. Specifically, I'm trying to build the list accomplished by the Javascript code here:
* http://chir.ag/projects/name-that-color/
and add it to my Java interactive color wheel:
* http://r0k.us/graphics/SIHwheel.html
BTW, I have converted his name that color Javascript (ntc.js) to a native Java class. It is freely distributable, and I host it here:
* http://r0k.us/source/ntc.java
-- Rich
Edited by: RichF on Oct 7, 2010 7:04 PM
Silly forum software; I can't see what made it go italic at the word new.

I am implementing a sort infrastructure along the lines of camickr's working example, above. Part of my problem is that I am new to both lists and collections. I've tried searching, and I cannot figure out why the compiler doesn't like my "new":
public class colorName implements Comparable<colorName>
    String     name, hex;
    int          hsi;
    static List<colorName> colorNames;
    public colorName(String name, String hex)
     float     hsb[] = {0f, 0f, 0f};
     int     rgb[] = {0, 0, 0};
     int     h, s, b;     // b for brightness, same as i
     this.name = name;
     this.hex = hex;
     // Now we need to calculate hsi,
     this.hsi = (h << 10) + (s << 6) + b; // hhhhhhssssiiiiii
    ***   findColorName() performs 3 functions. First, it
    *** will auto-initialize itself if necessary. Second,
    *** it will perform 3 sorts:
    ***   -3) byHSI: sort by HSI and return first element of sorted list
    ***   -2) byNAME: sort by name and return first element of list
    ***   -1) byHEX: (re)reads ntc.names, which is already sorted by HEX;
    ***               returns first element of list
    *** Third, on 0 or greater, will return the nth element of list
    *** Note: ntc.init() need not have been called.
    public colorName findColorName(int which)
     if (which < -3) which = -3;
     if (which >= ntc.names.length) which = ntc.names.length - 1;
     if (which == -1) colorNames = null;     // free up for garbage collection
     if (colorNames == null)
     {   // (re)create list
         colorNames = new ArrayList<colorName>(ntc.names.length);
         for (int i = 0; i < ntc.names.length; i++)
             colorNames.add(new colorName(ntc.names[1], ntc.names[0]));
        if (which == -1) return(colorNames.get(0));
}On compilation, I receive:
D:\progming\java\ntc>javac colorName.java
colorName.java:117: cannot find symbol
symbol : constructor colorName(java.lang.String[],java.lang.String[])
location: class colorName
                colorNames.add(new colorName(ntc.names[1], ntc.names[0]));
                               ^
1 errorLine 117 is the second-to-last executable line in code block. I know it is finding the ntc.names[][] array the ntc.class file. I had forgotten to compile ntc.java, and there were other errors, such as in line 115 where it couldn't find ntc.names.length. Compare camickr's two lines:
          List<Person> people = new ArrayList<Person>();
          people.add( new Person("Homer", 38) );As far as I can tell, I'm doing exactly the same thing. If you have any other feedback, feel free to make it. The full source may be found at:
* http://r0k.us/rock/Junk/colorName.java
PS1: I know I don't need the parenthesis in my return's. It's an old habit, and they look funny to me without them.
PS2: My original design had the "static List<colorName> colorNames;" line defined within the findColorName() method. The compiler did not like that; it appears to be that one cannot have static variables within methods. Anyway, that's why I don't have separate sorting and getting methods. I'm learning; "static" does not mean, "keep this baby around". Its meaning is, "there is only one of these babies per class".
-- Rich

String array into formula node

Hello,
I am taking data from SQL, I am getting multiple rows of data for many different devices. I would like to wire the data into a formula node so I can sepearate and sort via script. However, I am getting an error for "Polymorphic terminal cannot accept this data type". Is there a work around? Can I not wire in a string array to a formula node.
/r
Travo

There are lots of basic string VIs that you can use to parse the string and separate out the individual fields. I would recommend "programming" your application using script nodes. Use the native language. LabVIEW is a fully functional and capable programming language.
Mark Yedinak
"Does anyone know where the love of God goes when the waves turn the minutes to hours?"
Wreck of the Edmund Fitzgerald - Gordon Lightfoot

Large string array in 6.1 is extremely slow

Good day all,
While this is in to tech support at NI, I wanted to see if anyone else has encountered it.
I am upgrading from 6.0.2 to 6.1. Several large (2500 rows by 250 columns or larger) string arrays are used as inputs into subvi's. Under 6.0.2, these functions run in tenths of seconds, while under the converted 6.1 vi's they run in 20 seconds or more!
Tracing back using probes, the problem is occurring at the point of the input. It is appears that the array is taking many seconds to copy from the input to the wire on the diagram.
Array controls generated in 6.1 (not converted from 6.0.2) seem to function just fine. Using a save with options... to convert back to 6.0.2, the vi's again function in tenths of
seconds.
Anyone have any ideas?
Thanks!

I hear what you're saying about legacy code...
Something you might want to be looking at for the future is migrating to a structure where the data is stored in a 1D array, where each element is a cluster contain the data that's now in a single row. This would be the most straight-forward change, but could make getting at the data tricky, depending on how you need to be able to search it.
Alternately, you could have a cluster containing arrays of each of the row values.In this structure element 0 of all the arrays is the first "row", element 1 of the arrays is the second "row" and so on. This structure at first blush looks more complicated, but it's really not, plus it would allow you to use any value (or combination of
values) to search for a specific row without a lot of parsing.
If the data that is in the example VIs you posted is typical, either of these changes would be advantagous because it looks like there is a lot of reptative data that might be able to be encoded in an enum. Plus storing numbers as numbers often reduces the memory required and produces a predictable memory footprint (an I32 will always take-up 4 bytes per value regardless of how large of small the number is). My sense is that the variability of the string size is what's killing you.
One thing that would make this sort of dramatic change somewhat easier is that because you are changing the basic datatype of the interface, you aren't going to have to worry about finding all the places the change will effect--the wires will be broken.
If you ever decide to take this on, give a hollar.
Mike...
Certified Professional Instructor
Certified LabVIEW Architect
LabVIEW Champion
"... after all, He's not a tame lion..."
Be thinking ahead and mark your dance card for NI Week 2015 now: TS 6139 - Object Oriented First Steps

Sort a string :: Please help.

Hello Everyone,
I am having this very simple problem of sorting a String. please help.
     static String sortString(String str){
          List list = Arrays.asList(str);
          Collections.sort(list);
          for(int i=0, n=list.size();i<n;i++){
               System.out.println(","+ list.get(i));
The function is supposed to take a String and sort it & print it out. This should be simple. Where am I making mistakes? Please help!!

Hello Everyone,
I am having this very simple problem of sorting a String. please help.
     static String sortString(String str){
          List list = Arrays.asList(str);
          Collections.sort(list);
          for(int i=0, n=list.size();i<n;i++){
               System.out.println(","+ list.get(i));
               return str;
The function is supposed to take a String and sort it & print it out. This should be simple. Where am I making mistakes? Please help!!

Sort and Object array of Arrays

Hi,
I have an object array that contains a String[] and an int[].
Object[String[], int[]]
The values in the Strings array must be in the same position in the array as those in the int array i.e
String [0] is the string representation of int[0].
Its for a bar chart.
That is all working beautifully.
Now however I want to sort the int array in descending order by the value of the ints in the array and thus the order or the String array has to mirror this.
I am using a comparator to do this but it just wont work. I'm sure this is the way but how should it look?
Has anybody got any ideas?
Thanks in advance,
L.

use the bubblesort:
    for (int i = a.length; --i >= 0; ) {
        for (int j = 0; j < i; j++) {
            if (a[j][1] > a[j+1][1]) {
                int temp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = temp;
    }

String array operations

Hello. I am trying to implement a method which receives a string array called SCREEN and a string called DITHERED.
I want to check how many CHARS from DITHERED are in SCREEN.
When I try to compile I get "An illegalaccess exception ocurred. Make sure your method is declared to be public". Any help? THANKS
class ImageDithering
    public int count(String dithered, String[] screen)
        int num=0;
        for(int i=0;i<screen.length;i++)
            for(int j=0;j<screen.length();j++)
for(int k=0;k<dithered.length();k++)
if(screen[i].charAt(j)==dithered.charAt(k))
num++;
break;
return num;
}Edited by: devesa on Aug 5, 2010 9:38 AM

devesa wrote:
Hello. I am trying to implement a method which receives a string array called SCREEN and a string called DITHERED.
I want to check how many CHARS from DITHERED are in SCREEN.Well, the method you've chosen is just about as slow as it can be.
A few questions:
1. Which has more characters: 'dithers' or 'screen'?
2. Do you know about StringBuilder?
3. Do you know about [String.indexOf()|http://download.oracle.com/javase/6/docs/api/java/lang/String.html#indexOf%28int%29]?
4. Have you thought about sorting your strings first?
Winston

Two dimension string array in teststand

Hello,
I want to pass a two dimension string array from a labWindows dll into Teststand. My labwindows dll:
#define NR_columns 12
#define NR_rows 1200
#define NR_hight 1024
int__declspec(dllexport) __stdcall sort( char pspec[NR_columns][NR_rows][NR_hight])
The call of the dll in teststand looks like the attached picture in the doc file.
and I got the error message which shows the attached second picture in the doc file
what is the problem?
regards
samuel
Attachments:
Error1.doc ‏94 KB

Hello Samuel,
I'm not experienced in LabWindows but I think the reason for this Error is the dimension of FileGlobals.loadspec in TestStand. The Error Dialog displays for this String Array [0..11][0..1200]. That's an array of 12 and 1201 elements but function is expecting 12 and 1200 elements.
I hope this helps.
Kind regards
C. Dietz
Test Engineering
digades GmbH
www.digades.com

How can I sort a string

Hi,
I want to sort a string (daycode), I use the daycode to sort my data. Now i want to sort the daycodes, but i do not know how.
Example: the daycode is a10r, so a is the first shift in week (b the second and so on), 10 is the week in year, r is the year.
Now i have a array with daycode-strings and want to sort it to year, week, shift (normaly it is sorted to the first letter).
Someone with a good idea???
Thanks a lot
Marco

Try this vi and see if it is something you might be looking for and if not maybe you could explain a little more about what you want to do.
Joe.
"NOTHING IS EVER EASY"
Attachments:
sort.vi ‏15 KB

3D string array to file

How can I write a 3D string array to file?

sascha:
You could do this a lot of different ways.
The first and most obvious thing that comes to my mind is that you can
think about a 3D array as an array of 2D arrays. (For that matter a
2D array is an array of 1D arrays.)
Thus you could use a for loop to index your 3D array down to 2D and
then perform multiple writes to write each 2D array "element" of this
array of 2D arrays to disk. You would probably want to write some
sort of header which defines how many dimensions there are in the
array so that whatever reads it back later will have an easier time
reading it back. (Otherwise you'd have to implement EOF handling for
the read back portion.)
To read it back you just use the same logic but build a 3D array using
a 2D read inside a for loop.
Dou
glas De Clue
LabVIEW developer (looking for a job...
[email protected]
[email protected] (SaschaS) wrote in message news:...
> How can I write a 3D string array to file?

Sort an String Array

Similar Messages

Maybe you are looking for