Question

1. Read size
2. Read a[1],a[2],...a[size]
3. i=0
4. Whileli<size)
5. j=i+1
6. While(j<size)
7
If a[i] <alil then
8. t= a[i];
9. a[i] = alil
10. all = t;
11. End If
12. j=j+1
13. End While
14. i=i+1
15. End While
16. i=0
17. While (i<size)
18. print all
19. i=i+1
20. End While​

Answer 1

Answer:

it's am algorithm for which program ? it is

Explanation:

okay please tell

Answer 2

Answer:

bee

Explanation:

dbnssjsjsjkwwklqlansks smndndkdne