Hi, i have some problem to sort stacks. I need to sort 5+ stacks.
For example, i have 5 stacks. 3 of them are full. and 2 empty. >>>>
[ 5] [12 ] [1 ]
[ 7] [10 ] [3 ]
[ 9] [ 4 ] [ 6]
[ 8] [ 11] [ 2] __ __
I need to know how sorting the stacks in 1 eficient option of N options.For example:
6 12
5 11
2 4 8 10
1 3 _ 7 9 (this is an option) other option can be
-------
4 8 12
3 7 11
2 6 10
1 5 9 _ _ , etc.
The problem is coz them are stacks u can only see the first element on top of each stack, also u can move only the first element at top and only 1 element per time, but if u move that element u need to send it to another stack whit space.
I hope some1 can give me an idea to resolve this problem. Thx.
This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.
Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.
If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.
Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.
Save solutions to your questions, answers you’ve discovered through searching plus helpful articles in your personal knowledgebase for easy future access.
Access the answers to your technology questions today.
30-day free trial. Register in 60 seconds.
Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.
Try it out and discover for yourself.
30-day free trial. Register in 60 seconds.
Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.
The stacks can start with "m" items each, U can't have m+1 items in one stack. Also, the size of all stacks is the same including the empty stacks. Its not posible to put one more item in a full stack.
Inputs needed :
- M (Lenght of each stack, cant be changed)
- N ----> Amount of stacks. (If the amount is pair N/2 stacks fulls and N/2 empty and if the amount is not pair N/2+0.5 Fulls and N/2-05 emptys)
at the example M = 4 and N = 5. so 5/2+0.5 = 3 stacks full with 4 elements each and 5/2-0.5 2 empty.
Sorry for the delay. I have been trying to think of an optimal algorithm, but so far no luck.
It resembles the Towers of Hanoi problem, except that the initial state is un-ordered.
I suggest looking into a merge sort strategy.
Try getting all stacks separately sorted, and then merge them together into one big sorted stack (spread out over multiple stacks because of size restrictions).
Sorting the stacks separately should be possible by using the empty stacks as temporary space.
An alternate approach could be to create sorted stacks by looking at the top items of each of the current stacks, and moving the smallest to a new stack, repeatedly, making sure that the new stack remains ordered.
I have a visual example of the program that i need to do :
http://rapidshare.com/file
befor put PLAY(JUGAR) you can put the size of the window and following that the amount of stacks would increase or will fall.
The unic problem is autosort it =/ coz the size of stacks and the amount depends of the window size.
"An alternate approach could be to create sorted stacks by looking at the top items of each of the current stacks, and moving the smallest to a new stack, repeatedly, making sure that the new stack remains ordered"
I was thinking something seemed, but using the quicksort algorithm putting a random box of top in one of the empty stacks and then send the biggest boxes to right and smallest to left.
Thx for ur help.
Hope u can see the program and comment . Ty^^
I hope you don't mind, but I don't just run executables I download ;) It's one of those rules that has kept me relatively safe hehe.
>> I was thinking something seemed, but using the quicksort algorithm putting a random box of top in one of the empty stacks
What if you don't take a random one. but instead take the smallest ? Next, you take the next smallest (but that is higher than the previous). Continue until you can go no further. The new stack should now be a sorted stack from smallest to highest. You can repeat this until all the original stacks are arranged in new sorted stacks (all from smallest to highest). Once you have nothing but sorted stacks, they can be merged together to get the final completely sorted arrangement.
Business Accounts
Answer for Membership
by: Infinity08Posted on 2009-11-06 at 08:00:01ID: 25760253
>> 6 12
>> 5 11
>> 2 4 8 10
>> 1 3 _ 7 9 (this is an option) other option can be
I assume the 5 and 6 were supposed to be on the second stack here ?
Will the values always start from 1, and go up to n, where n is the amount of values ?