• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

galgotia | bca 1 | Question 4

what will be output?

procedure fun(arr, n)
   if n = 1 then
       return
   end if
   count = 0
   for i from 0 to n - 2
       if arr[i] > arr[i + 1] then
           swap(arr[i], arr[i + 1])
           count = count + 1
       end if
   end for
   return
   call fun(arr, n - 1)
end procedure

(A)

Insertion Sort Recursively

(B)

Bubble Sort Recursively

(C)

Selection Sort Recursively

(D)

None

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments