Question

Give me a solution step by step.. Please no other comments.. If you know answers then you reply me... If you are right and your answer is step by step I give you 15 likes... ​

Answer 1

Step-by-step explanation:

Step-by-step explanation:

$\huge\red{Answer}$

➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡

☆☞ [ Verified answer ]☜☆

class BubbleSort { void bubbleSort(int arr[]) { int n = arr.length; for (int i = 0; i < n-1; i++) for (int j = 0; j < n-i-1; j++) if (arr[j] > arr[j+1]) { // swap temp and arr[i] int temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } /* Prints the array */ void printArray(int arr[]) { int n = arr.length; for (int i=0; i

jai siya ram☺ __/\__

➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️

¯\_(ツ)_/¯

plz mark me as the brainliest

$\huge\green{Thanks}$