Add files via upload

Author: AdityaSeth777

20 - Sorting/Solution.c

@@ -0,0 +1,26 @@
+#include<stdio.h>
+int main(){
+
+	int i, j, n, temp, swap=0; 
+	scanf("%d", &n);
+	int arr[n];
+
+	for(i=0;i<n;i++){
+		scanf("%d", &arr[i]); 
+	}
+	//Aditya Seth
+	for(i=0;i<n;i++){ 
+		for(j=i+1;j<n;j++){
+			if(arr[i] > arr[j]){
+				temp = arr[i];
+				arr[i] = arr[j]; 
+				arr[j] = temp;
+				swap++;	
+			}
+		}
+	}
+	printf("Array is sorted in %d swaps.\n", swap);
+	printf("First Element: %d\n", arr[0]);
+	printf("Last Element: %d\n", arr[n-1]);
+	return 0;
+}

20 - Sorting/Solution.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    int n;
+    cin >> n;
+    vector<int> arr(n);
+    for (int i = 0; i < n; i++) {
+        cin >> arr[i];
+    }
+
+    int numSwaps = 0;
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < n - 1; j++) {
+            if (arr[j] > arr[j + 1]) {
+                int tmp = arr[j];
+                arr[j] = arr[j + 1];
+                arr[j + 1] = tmp;
+                numSwaps++;
+            }
+        }
+        if (numSwaps == 0) break;
+    }
+    //Aditya Seth
+
+    printf("Array is sorted in %i swaps.\n", numSwaps);
+    printf("First Element: %i\n", arr[0]);
+    printf("Last Element: %i\n", arr[arr.size() - 1]);
+
+    return 0;
+}

20 - Sorting/Solution.kt

@@ -0,0 +1,22 @@
+fun main(args: Array<String>) {
+    val scan = Scanner(System.`in`)
+    val arrCount = scan.nextLine().trim().toInt()
+    val arr = scan.nextLine().split(" ").map { it.trim().toInt() }.toTypedArray()
+    var numSwaps = 0
+    for (i in 0 until arr.size) {
+        for (j in 0 until arr.size - 1) {
+            if (arr[j] > arr[j + 1]) {
+                val tmp = arr[j]
+                arr[j] = arr[j + 1]
+                arr[j + 1] = tmp
+                numSwaps++
+            }
+        }
+        if (numSwaps == 0) {
+            break
+        }
+    }
+    println("Array is sorted in $numSwaps swaps.")
+    println("First Element: ${arr[0]}")
+    println("Last Element: ${arr[arr.size - 1]}")
+}

20 - Sorting/Solution.py

@@ -0,0 +1,19 @@
+n = int(input())
+arr = [int(x) for x in input().split(" ")]
+
+num_swaps = 0
+
+for i in range(n):
+    for j in range(n - 1):
+        if arr[j] > arr[j + 1]:
+            tmp = arr[j]
+            arr[j] = arr[j + 1]
+            arr[j + 1] = tmp
+            num_swaps += 1
+
+    if num_swaps == 0:
+        break
+#Aditya Seth
+print("Array is sorted in " + str(num_swaps) + " swaps.")
+print("First Element: " + str(arr[0]))
+print("Last Element: " + str(arr[len(arr) - 1]))

20 - Sorting/Solution.rb

@@ -0,0 +1,25 @@
+#!/bin/ruby
+n = gets.strip.to_i
+a = gets.strip
+a = a.split(' ').map(&:to_i)
+
+i=0
+numSwaps=0
+while n>i do
+    j=0
+    while n-1>j do
+        if a[j]>a[j+1]
+            a[j], a[j+1] = a[j+1], a[j]
+            numSwaps+=1
+        end
+        j+=1
+    end
+    if numSwaps==0
+        break
+    end  
+    i+=1
+end
+#Aditya Seth
+puts "Array is sorted in #{numSwaps} swaps."
+puts "First Element: #{a[0]}"
+puts "Last Element: #{a[n-1]}"