Sort by Count in SQ01

Hi Guru's First time posting so be gentle !!
In SQ01 does anyone know how to sort by the count or is there a formula which can be used in a complex calculation to return a number of records which has been repeated.
for example the number of times a material appears in a storage type sorted in descending order by the count of the material.
Thank you for your time to look.
Edited by: GTHURK on Jul 12, 2010 5:57 PM
Edited by: GTHURK on Jul 12, 2010 5:58 PM

Hi George,
Did you ever find a solution to this?  I appreciate it was a long time ago.
Regards,
Stephen

Similar Messages

  • Sorting and deleting in SQ01..plz reply soon

    Hi all,
    i am developing ABAP query through transactions SQ01, SQ02 and SQ03.
    first i went to SQ03 then to SQ02 and then to SQ01.
    When i am going to SQ01, i want to sort the output based on one field.
    It shown there that if you want to sort on the basis of any field, drag that field to the main window.
    But i am not able to drag the field.
    And i want to sort in decending order and i want only the first record in the output, the remaining should get deleted.
    Can anyone help me out with this.
    Thanks in advance,
    Sonali

    Veerendra,
    If I remember correctly, simplest way is to put the applet ".class" file in the same directory (on the Web server) as the HTML page that contains the "applet" tag.
    I guess, when you click on a link, you can go to another HTML page containing the applet -- although I don't remember ever doing anything like this myself.
    Good Luck,
    Avi.

  • Count first two columns

    Hello,
    I have a count requirement that i havent been able to solve by searching sdn.  Maybe someone can help.
    I have a query built on a multiprovider that points to two basic cubes.  The basic cubes do not contain a count key figure.  The first two columns of my query are characteristics.  My requirement is to count the occurences of the combination of the first two column (characteristics).  I am looking for a way to do this in the query so i do not have to reload the cubes as they have large volumes of data.  All the suggestions i have been able to find on sdn seem to be only for counting a single characteristic.  Is there a way to count the combination of two?
    Regards,
    TMS

    Hi Create a count using the formula or calculated ket figure for the count unique id like client id for your infocube.
    so you will have a count for each row now. place this count object in your column.
    now select the two char or the group whatever you want a count in your row.
    select query properties and select the display tab and make sure the option - hide repeated key values is selected (normally by default it is selected). Then select each of the char in rows and in free char and set the option under display tab result rows - always suppress.
    Execute the query now. you will get the list of char and their count. sort the count by descending to get the most duplicate entries by their highest number on top in the count coulmn.
    you can also ignore the rows which donot have a duplicate i.e count more than 1 by creating a new condintion on the count key figure > 1 and restricting the condition  by only the group of char you have given in the column. so that you can also do a drill down by free char in your query and it will only show the duplicates group.
    Hope it helps.
    regards,
    Siva

  • Showing column value as counter in sql query - report

    I created a classic report with search bar based on an sql query. I would like to show the "notes" column in this query using some sort of counter and as a hyperlink to another section on the page (same idea as footnotes in a book). So if I have 10 rows and 5 have "notes". I should show 1,2,3,4,5 in the notes column for those rows and the number gets displayed as a link to another section listing the notes 1 through 5.
    I was thinking of creating a hidden page item as the counter with value of 0 and then in my query doing counter+1 but i'm not sure how to do this or if i can do that...
    If anyone can help or have any other ideas I would really appreciate it!!
    Thanks,
    Hindy

    Well, I'm doing this in VB and the subquery is dynamic. I'm passing an ADO recordset to a routine that sets up a listview to display the results. The number of columns selected can vary. My idea was to size the columns appropriately based on the size of the data. Within the display routine I could:
    sql = "SELECT "
    for i = 0 to oRS.Fields.Count - 1
    sql = sql & "MAX(LENGTH(" & i & ")), "
    next 'i
    sql = sql & "FROM (" & oRS.Source & ")"

  • Multi column sorting

    I am wondering if it is possbile to sort data grids in multi
    columns?? For example lets say the data grid simply looks like
    this:
    Name
    Date
    Art 10/29/06
    Chris 12/02/04
    Bob 02/21/07
    Bo 08/08/05
    And i want to sort it in abc order first then within that
    sort(abc order) have does be sorted again by date so that A's will
    stay together, B's and so on...Is this possible and if so how?
    Thanks for all the help

    here is what i have...it crashes after the first click....
    rivate function ctrlCheck(ke:KeyboardEvent):void // checks to
    see if the ctrl key is pressed to do a multicolumn sort.
    if( ke.keyCode == 17) ctrlChecker =true;
    else ctrlChecker = false;
    private function resortColumns(le:ListEvent):void //if there
    is more than one page of results resort the columns and requery,
    else just resort
    colSortedOn = new String("");
    var sortDirection:String = new String("");
    var s:Sort=new Sort();
    var count:int=0;
    var arr:Array=new Array();
    if(le.rowIndex == 0)//get the column sorted on and attach
    that to the query and requery
    if(ctrlChecker==true)
    while(ctrlChecker==true)//while the user is still holding
    the ctrl key
    colSortedOn =
    DataGridColumn(datagrid1.columns[le.columnIndex]).dataField.toString();
    if(DataGridColumn(datagrid1.columns[le.columnIndex]).sortDescending)
    sortLoadDirection = true;
    else
    sortLoadDirection = false;
    arr[count]=new SortField(colSortedOn, true,
    sortLoadDirection)
    count ++;
    for(var i:int =0; i<arr.length; i++)
    s.fields
    =arr
    datagrid1.dataProvider.sort= s;
    datagrid1.dataProvider.refresh();
    else //there is no sort order taking place, the item click
    was something else entirely
    parentDocument.sortCheck = 1;
    }

  • Create view sorted by group frequency

    Hi -
    I am wondering what the best way to sort by the frequency of a group is.  (IE - I would like to have the items that occur the most on the top)
    Example of what the view would look like grouped by Item and sorted by count of occurrences of that item:
    Count=16
    Item:Item 100 (7)
    Item:Item 101 (5)
    Item:Item 204 (3)
    Item:Item 105 (1)
    etc...
    What is the best way to accomplish this
    Jesse A. Brandenburg

    Hi,
    According to your description, my understanding is that you want to sort the grouped value.
    You can do it by modifying your XSLT Data View.
    For detailed information, you can refer to the link:
    http://tudorolariu.blogspot.jp/2008/10/custom-group-order-in-sharepoint-list.html (pay attention to Tudor Olariu's comment)
    Best Regards,
    Wendy
    Wendy Li
    TechNet Community Support

  • The time complexity of "Sort 1D Array"

    Does anyone know the time complexity of "Sort 1D Array"? The document of this function does not say anything about that, so I write test VI to sort an array of 10000 integer elements. It seems that the excution time is less than 1 second, so I guess the complexity is O(n*logn). Any suggestion would be appreciated, thanks.

    A few thoughts based on my recollection of that old coding challenge.  There are different kinds of algorithmic approaches you may consider.
    1. A simple approach to that challenge could involve a lot of search / lookup functions.  Each time you parse a word, you perform a search to see if it's in your list already.  If so, increment its count.  If not, add it to the list with count=1.
       This was far too slow for word counting large docs.  Too many slow-ish searches.  But pretty easy to implement and maybe good enough for smaller docs.
    2. I pursued an approach that used hashing instead of searches.  It *seemed* too slow, but some months after the challenge when I had another use for the core hash table functionality, I found a really dumb bug that I'd overlooked before.  Fixing it improved the speed by something like 100x.  (Missed one spot where I needed a shift register to enforce in-placeness).
       This is largely the same approach, merely trying to speed up the lookup/search function via a more complex technique (hash tables).  As I found out, the complexity makes it more bug-prone.  Still, once fixed, lookup speed is in the order of constant with no clear dependency on the number of elements in the hash table.  (Note: it *is* still dependent on the "fill ratio".  You want enough memory available to size your table for maybe ~25% usage or less.)
    3.  One idea I tried out was to maintain a separate list of the 10 or 25 most-common words, sorted by count.  (The main reason was that there could be a tie for 4th place at the end, and I wanted enough extra candidates around to get the correct tie-breaker result.)  Each time I parsed another word and incremented its count, I'd check to see whether its new count qualified it to belong in the special most-common list.  I still did a lot of lookup and sort stuff, but it was always on a very
    There are surely other kinds of data structures and algorithms available.  Do you have a specific app in mind for this?  Or just generally curious?  I ask because some of the things one might do to optimize for a specific app (or code challenge) wouldn't be so appropriate as a general-purpose routine.
    -Kevin P.

  • Simple counter in seconds

    Hi,
    In my code I have a while loop that may or may not take more than x secs to run. Once the while loop has been running for x secs I would to provide a series of commands. Therefore, I need some sort of counter. Will Tick Count help me with this? If so, how? If not, how can I create a counter for this simple task? Thank you.
    Alfredo
    Alfredo
    Solved!
    Go to Solution.

    Yes, Tick Count can be used for this, as well as other mechanisms. For example, you could use the Get Date/Time in Seconds function. Here's asome simple examples:
    Attachments:
    Example_VI_BD.png ‏6 KB

  • Counting items in the array

    Hello,
    I need a clean way to count the items in an array. I can sort them using :
    int []x=new int[150]; I'm using Math.random%10 to get intergers from 0-9;
    public static void countItem() // sort items in the array
    int min, temp;
    for (int i = 0; i < x.length-1; i++)
    min = i;
    for (int scan = i+1; scan < x.length; scan++)
    if (x[scan] < x[min])
    min = scan;
    // Swap the values
    temp = x[min];
    x[min] = x;
    x[i] = temp;
    but once they are sorted I am baffeled on a clean way to count how many of each item are listed.
    0001122222222333444444 etc up to 9.
    Thanks

    but once they are sorted I am baffeled on a clean way to count how many of each item are listed.
    0001122222222333444444 etc up to 9I think you're going about this the wrong way. First count, then you've implicitly sorted them (counting sort). public class CountingSort
        public static void main(String[] args)
            int[] arr = {4, 5, 1, 3, 3, 3, 7};
            countSort(arr);
            for (int i = 0; i < arr.length; i++)
                System.out.print(arr[i] + " ");
        static void countSort(int[] arr)
            // Assume all elements of arr are in range 0..9
            // initialise buckets to an array of zeroes - don't rely on this except in Java
            int[] buckets = new int[10];
            for (int i = 0; i < arr.length; i++)
                buckets[arr]++;
    // Now reconstruct the array in sorted order
    // k is the next element in the array to fill in
    int k = 0;
    for (int i = 0; i < arr.length; i++)
    while (buckets[i]-- > 0)
    arr[k++] = i;

  • Sorting ArrayLists

    How can you sort an ArrayList in ascending order without using the following line of code?
    Collections.sort(myArrayList);I've come up with a bit of code so far, but I have an error message that says "incompatible types" for the two lines that define variables first and second. The code is supposed to be able to sort the ArrayList called "list" in ascending order, and save it into an ArrayList called "list2"... except I can't use that wonderful line of code I mentioned earlier that makes life so much darned easier. The code I'm posting is just the horrible code I have so far for the method that should sort it... all ArrayLists, etc. have been defined and all that good stuff. Any help would be greatly appreciated.
    public static void sorter()
              int count=1;
              list2.add(list.get(0));
              for(int i=0; i<list.size(); i++)
                   for(int f=0; f<list2.size(); f++)
                        int first=list.get(count);
                        int second=list2.get(f);
                        if(first<second)
                             list2.add(0,list.get(count));
                             break;
         }

    Assuming the array holds Objects, you can't just assign them to an int. Try:    // with autoboxing
    // int first=(Integer)list.get(count);
        // without
    int first=((Integer)list.get(count)).intValue();[Edit]Indeed with autoboxingfor(Integer i=0;  // etc...

  • Help appending how many times an event ID has occurred next to the unique Event ID.

    Hello,
    I am trying to figure out how to find how many times an event occurred and then append that next to the single  -unique Event ID.
    The closest I can find is the Sort-Object Count but I can't figure out how to get that work within the below script.
    Any help would be appreciated, the below script works already. but just doesn't have that Event ID count. 
    Thank you for any help. 
    Below is the
    script to pull all Event Logs for each server, filter them to only display Warnings, Failures, and FailureAudits for Application, System, and Security logs and then remove all duplicate EventIDs so only 1 of each is shown. it then exports that info into a
    .CSV per server.
    param([string]$days= "31" )
    $servers = @("Server1", "Server2" "Server3", "Etc")
    $user = Get-Credential
    #Set namespace and calculate the date to start from
    $namespace = "root\CIMV2"
    $BeginDate=[System.Management.ManagementDateTimeConverter]::ToDMTFDateTime((get-date).AddDays(-$days))
    $store = "C:\Powershell\MonthlyMaintenance"
    foreach ($computer in $servers)
    $filter="TimeWritten >= '$BeginDate' AND (type='Warning' OR type='Error' OR type='FailureAudit')"
    Echo "Pulling Event Logs for $computer ..."
    Get-WmiObject Win32_NTLogEvent -computername $computer -Filter $filter |
    sort eventcode -unique |
    select Computername,
    Logfile,
    Type,
    @{N='TimeWritten';E={$_.ConvertToDateTime($_.TimeWritten)}},
    SourceName,
    Message,
    Category,
    EventCode,
    User |
    Export-CSV C:\Powershell\MonthlyMaintenance\$computer-Filter.csv
    Echo "Done."

    Unfortunately adding that to the script just outputs a bunch of jargon:
    #TYPE Microsoft.PowerShell.Commands.Internal.Format.FormatStartData
    ClassId2e4f51ef21dd47e99d3c952918aff9cd
    pageHeaderEntry
    pageFooterEntry
    autosizeInfo
    shapeInfo
    033ecb2bc07a4d43b5ef94ed5a35d280
    Microsoft.PowerShell.Commands.Internal.Format.AutosizeInfo
    Microsoft.PowerShell.Commands.Internal.Format.TableHeaderInfo
    9e210fe47d09416682b841769c78b8a3
    I did try adding it in various ways and removing the initial # Sort EventCode -unique | # and I just get the same jargon
    Am I adding it in wrong some how? 
    Thank you again for any help.
    param([string]$days= "31" )
    $servers = @("ComputerName")
    $user = Get-Credential
    #Set namespace and calculate the date to start from
    $namespace = "root\CIMV2"
    $BeginDate=[System.Management.ManagementDateTimeConverter]::ToDMTFDateTime((get-date).AddDays(-$days))
    $store = "C:\Powershell\MonthlyMaintenance"
    foreach ($computer in $servers)
    $filter="TimeWritten >= '$BeginDate' AND (type='Warning' OR type='Error' OR type='FailureAudit')"
    Echo "Pulling Event Logs for $computer ..."
    Get-WmiObject Win32_NTLogEvent -computername $computer -Filter $filter |
    sort eventcode -unique |
    select Computername,
    Logfile,
    Type,
    @{N='TimeWritten';E={$_.ConvertToDateTime($_.TimeWritten)}},
    SourceName,
    Message,
    Category,
    User,
    EventCode | Select Name,Count | FT -auto|
    Export-CSV C:\Powershell\MonthlyMaintenance\$computer-Filter.csv
    Echo "Done."

  • Ipod New Features and Functions Suggestions?

    I'm sure with the continuous updates for the Ipod Software that there is a place where we can make suggestions but I can't find it? That said, I have an idea I would like to post so that someone from development could take under consideration. As well this could be a thread for other's ideas as I'm sure we all have them. Here we go:
    1. Wouldn't it be great if while listening to music on your iPod using the shuffle feature, if you heard a song you like, you could press a button and have it return directly to the album from where it's located. When you have 20 - 60 GB of songs, scrolling back through menus to get to artists or songs is long and painful. This would also save serious battery time, etc.
    2. How about a feature on Itunes that allows you to sort or count how many songs (and size) that you have checked versus what you don't. I have 60 gb of music but only a 20gb iPod. Currently you have to use the "Allow iPod to create a playlist" feature to select 20 GB worth of music and then edit from there.

    There is a form you can use to submit suggestions for future iPods; messages submitted there will be read by the iPod engineers, while suggestions posted here may not be.
    (8995)

  • Condition doesn't seem to work, how to trap this

    #Hi Guys,#The If block only works if the server exists, otherwise it gives an exception.With try #catch i got the same problem. My code doesn't continue, the sleep never works.#Even with silent continue i get the exception. #Does anybody knows a good trap logic for AD objectsif (Get-ADComputer $hostName.toUpper()) {
    Write "$hostName exists"
    AddAd
    AddSccmGroup
    else {
    Write "$hostName does not exists"
    start-sleep -s 300
    Error:
    Get-ADComputer : Cannot find an object with identity: 'Serv9550' under: 'DC=domain,DC=local'.
    At D:\scripts\addcomputerad-vco5.ps1:102 char:9
    +     if (Get-ADComputer $hostName.toUpper()) {
    +         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
        + CategoryInfo          : ObjectNotFound: (DHGMS9550:ADComputer) [Get-ADCo
       mputer], ADIdentityNotFoundException
        + FullyQualifiedErrorId : Cannot find an object with identity: 'DHGMS9550'
        under: 'DC=anwb,DC=local'.,Microsoft.ActiveDirectory.Management.Commands. 
      GetADComputer
    Groetjes André

    I'm not sure what AddAd and AddSccmGroup are (I assume they perform some after actions once the machine is in AD), but do you want to call those if the computer has not yet been found in AD?
    The quickest approach to a loop would be something like this using a While and keeping it to true and then breaking out of the loop when a computer has been found:
    While ($True) {
    Try {
    if (Get-ADComputer $hostName.ToUpper() -ErrorAction Stop) {
    Write "$hostName exists"
    AddAd
    AddSccmGroup
    Break
    Catch {
    Write-warning "$hostName does not exists"
    start-sleep -s 300
    It may be worthwhile to have some sort of counter in case the system never shows up to avoid an infinite loop from happening.
    $Limit = 15
    While ($True) {
    $i++
    Try {
    if (Get-ADComputer $hostName.ToUpper() -ErrorAction Stop) {
    Write "$hostName exists"
    Break
    Catch {
    Write-warning "$hostName does not exists"
    start-sleep -s 300
    If ($i -eq $Limit) {
    Write-Warning "$hostname never came up after $limit tries!"
    Break
    Boe Prox
    Blog |
    Twitter
    PoshWSUS |
    PoshPAIG | PoshChat |
    PoshEventUI
    PowerShell Deep Dives Book

  • File naming, archiving and time management

    I've posted on this subject before, but I have a new twist that I'd like to get some feedback on.
    I usually import my photos, keeping the master (now called original) file name until the end of the calendar year.  At the end of the year, I like to change the original name for classification and archiving purposes.  By then, I've usually made all of the deletions for the year, so I feel comfortable renaming the photos with some sort of counter or index.  My preferred classification system is: "Custom Name"/"Image Date_"/"Counter" (0000).
    The problem that I'm experiencing is that it is impossible to rename my originals using this format without some inaccuracies if I try to name them all at once without readjusting the computer's internal time zone settings.  I live on the east coast, so if I have a photo shot at 10:30 pm PDT on 2011-03-14, it gets named with a date of 2011-03-15, which obviously isn't accurate for when that photo was shot.  Well, it is accurate based on East Coast Time, but I want the file to be renamed with the date that it was shot, where it was shot, not where my computer currently resides.  Of course, I could rename the batch of 2011 photos in segments, but that would mean multiple quits/reopens from Aperture in order to change the time zone appropriately.
    It seems that my only choices are to either rename my photos at the time of import using the correct time zone settings on my computer, or to not use this renaming format.  Neither of these options are very appealing, since this renaming format is my preferred method.
    I guess my question is: does anyone have any insights or advice on either how to better work around this problem, or if not, other renaming methods that they like to use for archival and organizational purposes?  I know there are many to choose from, but I'm looking for something simple, which also provides direct information about the image, should I want to reference my Originals (which I do outside of Aperture from time to time).
    Thanks for adding to this discussion...
    mac

    Allen,
    SierraDragon wrote:
    mac-
    Personally I create a folder for each Project and copy pix from CF card into those folders. Then I import from the backup hard drive into Aperture using the folder name as the Project name.
    Usually each Project includes only one day or less, and I may have YYMMDD_JonesWed_A, YYMMDD_JonesWed_B, etc. for a large or multiday shoot. I do not let any Project contain more than ~400 Nikon D2x RAW+JPEG files.
    Projects are just that and never put into folders other than by month and/or year, just a forever chronological list. All organizing is done via Albums and Keywords. JonesWed_2011 is a keyword that can be an Album instantly when needed; bride is a keyword; wed is a keyword; flower is a keyword; etc.
    I use wedding just as an example. The process applies to all kinds of shoots.
    I use the 1-9999 Nikon auto-numbering of image files, and never rename image files except  sometimes during export. That way original image names can always be found across mass storage devices in the future independent of any application.
    -Allen
    SierraDragon wrote:
    Usually each Project includes only one day or less, and I may have YYMMDD_JonesWed_A, YYMMDD_JonesWed_B, etc. for a large or multiday shoot. I do not let any Project contain more than ~400 Nikon D2x RAW+JPEG files.
    Why do you keep the photo count in a project to around 400 files or so?  Is it detrimental to speed, or are there other considerations that have led you to work this way?
    SierraDragon wrote:
    Projects are just that and never put into folders other than by month and/or year, just a forever chronological list. All organizing is done via Albums and Keywords. JonesWed_2011 is a keyword that can be an Album instantly when needed; bride is a keyword; wed is a keyword; flower is a keyword; etc.
    So, you are saying that you sometimes put projects into folders by month and/or year?  Or, do you just keep all projects at the top level of the hierarchy?  The only folders I use are at the top of my hierarchy, and they are by year, 2002, 2003, 2004...2012.  I then keep all of my projects in the appropriate year.  I used to keep folders that were named things like, "Travel", "Occasions"..., but this became problematic when I had overlap, and images could fit in more than one designated folder.
    SierraDragon wrote:
    I use the 1-9999 Nikon auto-numbering of image files, and never rename image files except  sometimes during export. That way original image names can always be found across mass storage devices in the future independent of any application.
    It sounds as though you don't actually rename your images at all, but rather just keep the original names.  I don't like to do this because after deletions, it creates gaps in my sequence, and I also end up with multiple images with the same name.  I like for each image to have its own unique identifier by name.
    I'm considering importing the images using a version name, where the version is named by the image date.  I'll keep the original file name intact until the end of the year, and then, should I decide to rename my files, I could base my renaming system off of the version name.  This will automatically capture the date of the image without being reliant on my computer's time zone settings.

  • Program not working correctly-Help!

    class Sort
         /* method takes an array of integers as an input,
         * and returns a copy with the element values sorted
         * by select method.
         int[] selectSort(int[] input)
              /*declare variables to be used in array */
              int x, y, max, temp;
              int[] select = new int[input.length];
              /*This loop reads the entire array */
              for(x = input.length - 1; x>0; x--)
                   max = 0;
                   /*This loop checks to see if any number is
                   lower possible greatest number /
                   for(y = 0; y <= x; y++)
                   {//Returns number if lowest number
                        if(input[y] > input[max])
                             max = y;
                        }//end of if statement
                   }//end of inner loop
                   /*Switches the values */
                        temp = input[x];
                        select[x] = input[max];
                        select[max] = temp;
              }//end of outer loop
              return select;          
         } //end of selectSort()
         /* method takes an array of integers as an input,
         * and returns a copy with the element values sorted
         * by bubble method.
         int[] bubbleSort(int[] input)
              int[] bubble = new int[input.length];
              for (int x = 1; x < input.length; x++)
                   for (int y = 0; y < input.length - 1; y++)
                        if (input[y] > input[y+1])
                             int temp = input[y];
                             bubble[y] = input[y+1];
                             bubble[y+1] = temp;
              return bubble;
         } //end of bubbleSort
    **********************Test Class**********************
    class TestSort
         public static void main(String[] args)
              /* count variable used as loop counter when
              * result table display is generated
              int count;
              /* variable for object of class Sort */
              Sort x;
              /* create object of class GroupEx2 */
              x = new Sort();
              /* create a source array of integer elements */
    int[] y = new int[5];
    /* assign values to array elements to be sorted     */     
              y[0] = 8;
              y[1] = 5;
              y[2] = 3;
              y[3] = 9;
              y[4] = 1;
              /* create variable for target of select sort array */
              int[] ss;
              /* create variable for target bubble sort array */
              int[] bs;
              /* call method to return an array with element values select sorted*/
              ss = x.selectSort(y);
              /* call method to return an array with element values bubble sorted*/
              bs = x.bubbleSort(y);          
              /* display original and sorted arrays in three columns*/
              System.out.print("Input Array" + "\t");
              System.out.print("Select Sort" + "\t");
              System.out.println("Bubble Sort");
              for (count = 0; count < y.length; count++)
                   /* Column 1: original array */
                   System.out.print("input[" + count + "] = " + y[count]);
                   /* tab between columns 1 and 2 */
                   System.out.print("\t");
                   /* Column 2: select sorted array */
                   System.out.print("select[" + count + "] = " + ss[count]);
                   /* tab between columns */
                   System.out.print("\t");
                   /* Column 3: bubble sorted array */
                   System.out.println("bubble[" + count + "] = " + bs[count]);
              } // end of display for loop
         } // end of main()
    } // end of class TestSort

    Thanks for the Bash! I'm surprised you had the time
    for it.Go back and look at your original post. A whole bunch of code, and the only description of the problem is "not working correctly." Do you honestly think that's a reasonable way to ask for help? Do you go to the doctor and say, "I'm sick" and then just wait for him to cure you? Do you take your care to the mechanic and say only, "It's broke"?
    Look, this is your problem and it's your responsibility to fix it. There are people here who are happy to help you, but it's up to you to provide a reasonable statement of what's wrong, what you've tried, what you don't understand. For instance:
    Does it compile? If not, post the complete error message.
    Does it run, but throw an exception? If so, post the stack trace.
    Does it not throw an exception, but not behave the way you expect? Then describe the expected beavior and the observed behavior.
    Do you really need to be told this stuff? It seems like common sense that when you're asking people to spend their time helping you, you should give them the information they need to be able to do so.

Maybe you are looking for