GATE | GATE-CS-2014-(Set-2) | Question 50

Last Updated :

Discuss

Comments

Consider the below program, what operation is performed below:

C++

void fun(int arr[], int n)
{
	
	if (n == 1)
		return;

	int count = 0;
	for (int i=0; i<n-1; i++)
		if (arr[i] > arr[i+1]){
			swap(arr[i], arr[i+1]);
			count++;
		}
		return;
	fun(arr, n-1);
}

void fun(int arr[], int n) {
    if (n == 1)
        return;

    int count = 0;
    for (int i = 0; i < n - 1; i++)
        if (arr[i] > arr[i + 1]) {
            int temp = arr[i];
            arr[i] = arr[i + 1];
            arr[i + 1] = temp;
            count++;
        }
    fun(arr, n - 1);
}

Java

void fun(int[] arr, int n) {
    if (n == 1)
        return;

    int count = 0;
    for (int i = 0; i < n - 1; i++)
        if (arr[i] > arr[i + 1]) {
            int temp = arr[i];
            arr[i] = arr[i + 1];
            arr[i + 1] = temp;
            count++;
        }
    fun(arr, n - 1);
}

Python

def fun(arr, n):
    if n == 1:
        return

    count = 0
    for i in range(n - 1):
        if arr[i] > arr[i + 1]:
            arr[i], arr[i + 1] = arr[i + 1], arr[i]
            count += 1
    fun(arr, n - 1)

JavaScript

function fun(arr, n) {
    if (n === 1)
        return;

    let count = 0;
    for (let i = 0; i < n - 1; i++)
        if (arr[i] > arr[i + 1]) {
            [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]];
            count++;
        }
    fun(arr, n - 1);
}

Insertion Sort Recursively

Bubble Sort Recursively

Selection Sort Recursively

None

This question is part of this quiz :

Recursion Quiz

Tags:

DSA Quiz

Share your thoughts in the comments

GeeksforGeeks