Want to protect your cyber security and still get fast solutions? Ask a secure question today.Go Premium

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 201
  • Last Modified:

Need Help With A Program

Hello all,

I'm making a program, in Visual Studio 6.0, that will do the following:

-Bubble Sort 100 Random Strings
-Show the original and sorted strings
-Be able to show both the decending and ascending sort results
-and use an array string

If you can whip up a program that does this, I will be very happy.

I also have access to Borland Compiler 5, and DJGPP if you are more comfortable with does.

Again Thank You.
0
jc2048
Asked:
jc2048
1 Solution
 
nietodCommented:
Why don't you try this yourself and post what you get done.  Then we can make suggestions.  You will learn much more that way.
0
 
PKothariCommented:
I can tell u the logic.
If u can write program and post it back
on the site if u encounter any problems then we can solve it.

Here's the logic

Display a menu
1.Ascending
2.Descending.
Use 2 dimensional arrays.
if(ascending)
{
  Get the 100 strings.
  Store them in 2 arrays.
  Start comparing.
  for(i=0;i<100;i++)
   {
    for(j=i+1;j<100;j++)
    {
     if(strcmp(a[i],a[j]))
      {
       temp=a[i];//temp-->temprorary variable
        a[i]=a[j]  //swap the numbers
        a[j]=temp;
      }
    }
  }
}
same in the case for descending only the if condition changes.

While displaying as u have 2 arrays one the original and other sorted u can display both of them
I think this solves u r problem
       
   
0
 
AlexVirochovskyCommented:
See as good example
http://www.snippets.org/strsort.c
0
 
ZivKatzirCommented:
Hi,
the idea behind bubble sort is quit simple :
 1. loop through all variables of the
    array.
 2. for every item perform check
    your condition.
 3. swap the two items if needed
 4. save the position of the last swaped
    argument.

the loop described above will make the
appropriate item (i.e. largest or smallest) be positioned in the last place of the array.

Now, repeate the proccess described above until no swaps were made. Each time scan the array to the position of the previusly saved position of the last swap (there is no need to compare variables positioned beyond the last swap since they are already in the correct order).

That's it, if still want a source code
I will write down some for you.
 
0
 
nietodCommented:
Its probably safe to assume that a question that hasn't got activity for 2 weeks is a dead question and not in need of answering.   Its also very likely that this is a school assignment, and thus it is a violation of EE's accademic policy to provide a complete answer to it.
0

Featured Post

Free Tool: Port Scanner

Check which ports are open to the outside world. Helps make sure that your firewall rules are working as intended.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now