Add files via upload

Author: tapumar

Sphere Online Judge/bsearch1.cpp

@@ -0,0 +1,30 @@
+#include <iostream>
+#include <stdio.h>
+#define ARRAY_SIZE(array) (sizeof((array))/sizeof((array[0])))
+using namespace std;
+
+int binarySearch (int * array, int left, int right, int key) {
+	if (left > right)
+		return -1;
+	int mid = (left + right) / 2;
+	if (array[mid] == key) {
+		if (mid == 0 || array[mid - 1] != key)
+			return mid;
+		return binarySearch (array, left, mid - 1, key);
+	}
+	if (array[mid] > key)
+		return binarySearch(array, left, mid - 1, key);
+	return binarySearch(array, mid + 1, right, key);
+}
+
+int main () {
+	int n, q, k;
+	int array[100000];
+	scanf ("%d %d", &n, &q);
+	for (int i = 0; i < n; i++)
+		scanf ("%d", &array[i]);
+	for (int z = 0; z < q; z++) {
+		scanf ("%d", &k);
+		printf ("%d\n", binarySearch(array, 0, n-1, k));
+	}
+}

Sphere Online Judge/codesptb.cpp

@@ -0,0 +1,55 @@
+#include<stdio.h>
+#include<string.h>
+#include<iostream>
+#include<algorithm>
+using namespace std;
+int a[200001];
+int te[200001];
+unsigned long long merge(int arr[],int temp[],int left,int mid,int right)
+{
+    int i=left;
+    int j=mid;
+    int k=left;
+    unsigned long long int icount=0;
+    while((i<=mid-1) && (j<=right))
+    {
+        if(arr[i]<=arr[j])
+        temp[k++]=arr[i++];
+        else
+        {
+            temp[k++]=arr[j++];
+            icount+=(mid-i);
+        }
+    }
+    while(i<=mid-1)
+    temp[k++]=arr[i++];
+    while(j<=right)
+    temp[k++]=arr[j++];
+    for(int i=left;i<=right;i++)
+    arr[i]=temp[i];
+    return icount;
+}
+unsigned long long int mergesort(int arr[],int temp[],int left,int right)
+{
+    unsigned long long int i=0;
+    if(right>left){
+        int mid=(left+right)/2;
+        i=mergesort(arr,temp,left,mid);
+        i+=mergesort(arr,temp,mid+1,right);
+        i+=merge(arr,temp,left,mid+1,right);
+    }
+    return i;
+}
+int main()
+{
+    int t,n;
+    scanf("%d",&t);
+    while(t--){
+        scanf("%d",&n);
+        for(int i=0;i<n;i++){
+            scanf("%d",&a[i]);
+        }
+        printf("%llu\n",mergesort(a,te,0,n-1));
+    }
+    return 0;
+}

Sphere Online Judge/mergsort.c

@@ -0,0 +1,61 @@
+#include <stdio.h>
+
+void merge(int left[],int l,int right[],int r,int A[])
+{
+	int i, j, k;
+	i = j = k = 0;
+	while (i < l && j < r) {
+		if (left[i] <= right[j]) {
+			A[k] = left[i];
+			i++;
+		} else {
+			A[k] = right[j];
+			j++;
+		}
+		k++;
+	}
+	while (i < l) {
+		A[k] = left[i];
+		i++;
+		k++;
+	}
+	while (j < r) {
+		A[k] = right[j];
+		j++;
+		k++;
+	}
+}
+
+void merge_sort(int A[], int n)
+{
+	int i, j, mid;
+	if (n < 2) {
+		return;
+	}
+	mid = n / 2;
+	int left[mid];
+	int right[n - mid];
+	for(i = 0; i < mid; i++) {
+		left[i] = A[i];
+	}
+	for(i = mid; i < n; i++) {
+		right[i - mid] = A[i];
+	}
+	merge_sort(left,mid);
+	merge_sort(right,n - mid);
+	merge(left,mid,right,n-mid,A);
+}
+
+int main()
+{
+	int A[100000], c = 0, i;
+	while(scanf("%d", &A[c]) != EOF) {
+		c++;
+	}
+	merge_sort(A,c);
+	for(i = 0; i < c; i++) {
+		printf("%d ", A[i]);
+	}
+	printf("\n");
+	return 0;
+}