Show an algorithm to place the set (6,2,1,9) into descending order using a flow chart and trace tables using diagrams or example

Question

I want to see how the program works especially the flow chart plus the algorithms as well from the start to stop

Answer 1

To quote my former computer science professor, the only good thing about bubble sort is it's name.
It's a very slow algorithm although it's conceptually easy to understand
So if you're working with a very large dataset it can run painfully slow
However, with a small dataset and with the faster CPUs' these days I guess the difference isn't that noticeable
Try quicksort. At least it can perform much faster unless the dataset is sorted in reverse order already

Answer 2

https://www.sololearn.com/learn/774/?ref=app

Answer 3

look up "bubble sort"

Answer 4

Algorithm is the step by step to giving task

Answer 5

Use BUBBLE SORT :
If (b>a){
temp=a;
a=b;
b=temp;}

Answer 6

1/2 algorithm (IDK what the technical name is):
1.Case Even - divide successfully and apply bubble sort after each iteration.
2.Case Odd - The middle value is the median, and, using that as the Pivot, do as in step 1
Bubble Sort :
temp = a
a = b
b = temp

Answer 7

Start and stop by flow chart

Answer 8

#using bubble sort
li=list({6,2,1,9})#we have to first type cast it to a list as set doenot has fixed index since it follows hashing.
for i in range(len(li)):
for j in range(len(li)):
if(li[i]>li[j]):
temp=li[i]
li[i]=li[j]
li[j]=temp
print(li)