BUBBLE SORT ALGORITHM

How did we know or what is an indicator if the variabe needed is an array or elements?

Later I'll send the flow chart for me to discuss it better.

What is better to do first, algorithm or flowchart?

What is the important of making algoritms?

Do you know, what are the sorting algorithm categories?

Informally, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output.

ahnmaria wrote:

What is better to do first, algorithm or flowchart?

For me, its better to make a flowchart first. because it will help you to know what will be the "flow" of your program.

chelsey wrote:

How did we know or what is an indicator if the variable needed is an array or elements?

You can identify the array if it is inside the square bracket [array] this is like the number or cabinet you have or a space in your cabinet where will you put your shoes and your shoes is what you called the elements which means the content is the element and the array is the one who handle your content.

ahnmaria wrote:

What is better to do first, algorithm or flowchart?

I chose to do first the algorithm so that you will identify better the flow of program before you do flow charting by the way there is no really a big difference between the two except that flowchart explain the flow of program in a graphical way.

ahnmaria wrote:

Do you know, what are the sorting algorithm categories?

There are many categories in sorting data and here are some:

1.Comparable elements
2.Bubble sort
3.Selection sort
4. Insertion sort
5. Shellsort
6. Heap sort
7. Merge Sort
8. Quick sort
9. Selection Problem
10.Decision Trees and Lower Bounds

and please search some more

ahnmaria wrote:

What is better to do first, algorithm or flowchart?

any of the two can be done first. Actually Flow chart is under the category of Algorithm which is a programming language

Anna wrote:

ahnmaria wrote:

Do you know, what are the sorting algorithm categories?

There are many categories in sorting data and here are some:

1.Comparable elements
2.Bubble sort
3.Selection sort
4. Insertion sort
5. Shellsort
6. Heap sort
7. Merge Sort
8. Quick sort
9. Selection Problem
10.Decision Trees and Lower Bounds

and please search some more    

11. Bucket Sort
* array of the size of maximum element + 1
*counts the number of elements of each
*useful where input is only small integers
12.
External Sorting
* Too large for main memory – skipping section
*Multiway Merge
*Polyphase Merge
*Replacement Selection

chelsey wrote:

How did we know or what is an indicator if the variabe needed is an array or elements?

Its a bit confusing but an array is a data structure that sorts or handle data

ahnmaria wrote:

What is better to do first, algorithm or flowchart?

it has the same importance

chelsey wrote:

How did we know or what is an indicator if the variabe needed is an array or elements?

array is the cabinet or space for shoes and elements are the shoes itself. hope that helps

VOVOFRIEND wrote:

ahnmaria wrote:

What is better to do first, algorithm or flowchart?

For me, its better to make a flowchart first. because it will help you to know what will be the "flow" of your program.  

I agree to that but if you are too good in imagining I think you do the algorithm first.

ralfh wrote:

chelsey wrote:

How did we know or what is an indicator if the variabe needed is an array or elements?

array is the cabinet or space for shoes and elements are the shoes itself. hope that helps

it is easy to understand the difference of the two just imagine a three layer cabinet and that will be your array then element is what you put there

Shiela wrote:

chelsey wrote:

How did we know or what is an indicator if the variabe needed is an array or elements?

Its a bit confusing but an array is a data structure that sorts or handle data

An array is a data structure that contains a group of elements. Typically these elements are all of the same data type, such as an integer or string. Arrays are commonly used in computer programs to organize data so that a related set of values can be easily sorted or searched.

Anna wrote:

ahnmaria wrote:

Do you know, what are the sorting algorithm categories?

There are many categories in sorting data and here are some:

1.Comparable elements
2.Bubble sort
3.Selection sort
4. Insertion sort
5. Shellsort
6. Heap sort
7. Merge Sort
8. Quick sort
9. Selection Problem
10.Decision Trees and Lower Bounds

and please search some more    

partioning strategy

Shiela wrote:

chelsey wrote:

How did we know or what is an indicator if the variabe needed is an array or elements?

Its a bit confusing but an array is a data structure that sorts or handle data

yeah shiela dont be confused you got it right!

Shiela wrote:

ahnmaria wrote:

What is better to do first, algorithm or flowchart?

any of the two can be done first. Actually Flow chart is under the category of Algorithm which is a programming language

when you do flow chart first you can easily understand the flow of your program

ahnmaria wrote:

Informally, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output.

and that will be the main thing that youll be manipulated to create a program.

ralfh wrote:

chelsey wrote:

How did we know or what is an indicator if the variabe needed is an array or elements?

array is the cabinet or space for shoes and elements are the shoes itself. hope that helps

haha like the example another is array are your house and you are the elements

ahnmaria wrote:

What is the important of making algoritms?

algorithm is the mind of the program.