Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Categories

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

sort function

programTomprogramTom Posts: 33Member
hi im having trouble sorting numbers that are entered in an array by the user. Im not sure if i should create another array to keep track of the order.
[code]

function Sort(order: OrderArray; numbers: NumberArray; entryAmount: Integer): Double;
var
sort: Double;
begin
for entryAmount := low(numbers) to high(numbers) do
begin
if (numbers[entryAmount]) //trying to sort?


end;


[/code]

Comments

  • zibadianzibadian Posts: 6,349Member
    : hi im having trouble sorting numbers that are entered in an array by the user. Im not sure if i should create another array to keep track of the order.
    : [code]
    :
    : function Sort(order: OrderArray; numbers: NumberArray; entryAmount: Integer): Double;
    : var
    : sort: Double;
    : begin
    : for entryAmount := low(numbers) to high(numbers) do
    : begin
    : if (numbers[entryAmount]) //trying to sort?
    :
    :
    : end;
    :
    :
    : [/code]
    :
    The bubble sort needs 2 nested loops:
    [code]
    for i := low(numbers) to high(numbers)-1 do
    for j := low(numbers) to i do
    if numbers[j] > numbers[j+1] then
    Swapnumbers;
    [/code]
  • programTomprogramTom Posts: 33Member

    : :
    : The bubble sort needs 2 nested loops:
    : [code]
    : for i := low(numbers) to high(numbers)-1 do
    : for j := low(numbers) to i do
    : if numbers[j] > numbers[j+1] then
    : Swapnumbers;
    : [/code]
    :
    thanks.
Sign In or Register to comment.