How do I arrange number without using array?

Question

5.00/5 (1 vote)

See more:

What can I used to arrange number from big until small without using array in C++?

What I have tried:

*This is a question.
Cause I find out most of the example will use array to solve this problem.
So without array, I don't know what can I used?

Posted 9-Jun-22 1:39am

The Kings

Updated 10-Jun-22 11:21am

Add a Solution

Comments

Richard MacCutchan 9-Jun-22 8:39am

The question is not clear. If you cannot use an array, or one of the STL containers then you cannot solve the question. In order to arrange a set of anything you must be able to store them somewhere. Maybe you need to reword your question.

enhzflep 9-Jun-22 11:00am

I could re-create the functionality of an STL container to achieve the same result as if I'd used one.
Is this beyond you? (I know it's not) Hint: Linked list or Tree.

Richard MacCutchan 9-Jun-22 11:09am

No it's not beyond me, but I cannot speak for the OP.

enhzflep 9-Jun-22 11:12am

Exactly my point. ;)

4 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Answer 1 · 2022-06-09T01:52:00

Solution 1

You have to use a collection (like the array), at least to store the numbers.
That said, using a std::multiset could be an advantageous, try:

C++

#include <iostream>
#include <set>
using namespace std;

int main()
{
  multiset<int, greater<int> > ms{1, 12, -3, 27, 2, 12, 42, 1, 53};

  for (auto i : ms)
    cout << i << " ";
  cout << endl;
}

Posted 9-Jun-22 1:52am

CPallini

Comments

The Kings 9-Jun-22 8:20am

But if I cant used std::multiset and array what else can I use? cause I'm just beginner so not allow to use.

[no name] 10-Jun-22 17:50pm

You can sort to output (stdout) with a state machine. No arrays or temporary storage required.

Patrice T · Answer 2 · 2022-06-09T16:37:00

Quote:
Cause I find out most of the example will use array to solve this problem.

Because arrange (sort) is easier done with array.

Quote:
So without array, I don't know what can I used?

Many data structures exist each with their own stength and weaknesses.
Main Data Structures are:
-Array
-Single Linked Lists
-Doubly Linked Lists
-Binary Tree
-Balanced binary Tree
...
Data Structures - GeeksforGeeks[^]

choose your poison :-)

merano99 · Answer 3 · 2022-06-10T11:21:00

Solution 4

Quote:

What can I used to arrange number from big until small without using array in C++?

If you can't use arrays or STL containers, then I would see the linked list data structure as the best alternative.
https://www.geeksforgeeks.org/data-structures/linked-list/
The alternatives of Patrice T's list are also conceivable.

Posted 10-Jun-22 11:21am

merano99

Comments

Patrice T 10-Jun-22 19:28pm

+5

Greg Utas · Answer 4 · 2022-06-09T04:28:00

Solution 2

When a set of numbers is of arbitrary size, I can't see a way to sort them without using something that is equivalent to an array, no matter what name someone chooses to call it.

There are n numbers, so something of size n has to hold them. That's basically the definition of an array.

If n is fixed and small, you could put the numbers in variables a, b, c... and sort them in a series of if statements that assigns the highest one to a, then the second highest one to b, and so on. But that gets very silly for n > 3.

I'm surprised that anyone would expect to find a way to do this without using an array, so I wonder if you might be trolling us.

Posted 9-Jun-22 4:28am

Greg Utas

Comments

enhzflep 9-Jun-22 10:57am

The thing that immediately stands out to me is that reasonable, efficient use of an array requires one to know the number of elements first.
Neither insertion-sort nor tree-sort have this limitation. Neither of em need an array either. :p

But without more info from the OP, one can only guess at the aim of the exercise. I could see such a question asked to learners serving any one of a number of purposes.

Greg Utas 9-Jun-22 12:03pm

I'd argue that insertion sort requires an array. But you've got a good point with tree sort.

enhzflep 9-Jun-22 19:44pm

I'd then turn around and point out the fact you can use a linked list when memory is fragmented and there isn't a contiguous section of memory large enough to hold the data.

Linked-lists and arrays are nothing like one-another, no?

How do I arrange number without using array?

4 solutions

Solution 1

Solution 3

Solution 4

Solution 2

Add your solution here

Preview 0

Existing Members

...or Join us