Sortings

All_Sortings/bubble.c

@@ -0,0 +1,37 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+void bubble(int *a,int n)
+{
+	int i,j,t;
+	for(i=0;i<n-1;i++)
+	{
+		int count=0;
+		for(j=0;j<n-i-1;j++)
+		if(a[j]>a[j+1])
+		{
+			count++;
+			t=a[j];
+			a[j]=a[j+1];
+			a[j+1]=t;
+		}
+
+		if(count==0)
+		break;
+	}
+}
+
+void main()
+{
+	int *a,i,n;
+	printf("Enter n : ");
+	scanf("%d",&n);
+	a=(int *)malloc(n*sizeof(int));
+	for(i=0;i<n;i++)
+	scanf("%d",&a[i]);
+	bubble(a,n);
+
+	printf("Sorted Array : ");
+	for(i=0;i<n;i++)
+	printf("%d ",a[i]);
+}

All_Sortings/insertionnew.c

@@ -0,0 +1,34 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+void insertion(int *a,int n)
+{
+	int i,j;
+	for(i=1;i<n;i++)
+	{
+		int y=a[i];
+			j=i;
+
+		while(j > 0 && y < a[j-1])
+		{	
+			a[j]=a[j-1];
+			j--;
+		}
+		a[j]=y;
+	}
+}
+
+void main()
+{
+	int *a,i,n;
+	printf("Enter n : ");
+	scanf("%d",&n);
+	a=(int *)malloc(n*sizeof(int));
+	for(i=0;i<n;i++)
+	scanf("%d",&a[i]);
+	insertion(a,n);
+
+	printf("Sorted Array : ");
+	for(i=0;i<n;i++)
+	printf("%d ",a[i]);
+}

All_Sortings/merge.c

@@ -0,0 +1,104 @@
+/* C program for Merge Sort */
+#include<stdlib.h> 
+#include<stdio.h> 
+
+// Merges two subarrays of arr[]. 
+// First subarray is arr[l..m] 
+// Second subarray is arr[m+1..r] 
+void merge(int arr[], int l, int m, int r) 
+{ 
+	int i, j, k; 
+	int n1 = m - l + 1; 
+	int n2 = r - m; 
+
+	/* create temp arrays */
+	int L[n1], R[n2]; 
+
+	/* Copy data to temp arrays L[] and R[] */
+	for (i = 0; i < n1; i++) 
+		L[i] = arr[l + i]; 
+	for (j = 0; j < n2; j++) 
+		R[j] = arr[m + 1+ j]; 
+
+	/* Merge the temp arrays back into arr[l..r]*/
+	i = 0; // Initial index of first subarray 
+	j = 0; // Initial index of second subarray 
+	k = l; // Initial index of merged subarray 
+	while (i < n1 && j < n2) 
+	{ 
+		if (L[i] <= R[j]) 
+		{ 
+			arr[k] = L[i]; 
+			i++; 
+		} 
+		else
+		{ 
+			arr[k] = R[j]; 
+			j++; 
+		} 
+		k++; 
+	} 
+
+	/* Copy the remaining elements of L[], if there 
+	are any */
+	while (i < n1) 
+	{ 
+		arr[k] = L[i]; 
+		i++; 
+		k++; 
+	} 
+
+	/* Copy the remaining elements of R[], if there 
+	are any */
+	while (j < n2) 
+	{ 
+		arr[k] = R[j]; 
+		j++; 
+		k++; 
+	} 
+} 
+
+/* l is for left index and r is right index of the 
+sub-array of arr to be sorted */
+void mergeSort(int arr[], int l, int r) 
+{ 
+	if (l < r) 
+	{ 
+		// Same as (l+r)/2, but avoids overflow for 
+		// large l and h 
+		int m = l+(r-l)/2; 
+
+		// Sort first and second halves 
+		mergeSort(arr, l, m); 
+		mergeSort(arr, m+1, r); 
+
+		merge(arr, l, m, r); 
+	} 
+} 
+
+/* UTILITY FUNCTIONS */
+/* Function to print an array */
+void printArray(int A[], int size) 
+{ 
+	int i; 
+	for (i=0; i < size; i++) 
+		printf("%d ", A[i]); 
+	printf("\n"); 
+} 
+
+/* Driver program to test above functions */
+int main() 
+{ 
+	int arr[] = {12, 11, 13, 5, 6, 7}; 
+	int arr_size = sizeof(arr)/sizeof(arr[0]); 
+
+	printf("Given array is \n"); 
+	printArray(arr, arr_size); 
+
+	mergeSort(arr, 0, arr_size - 1); 
+
+	printf("\nSorted array is \n"); 
+	printArray(arr, arr_size); 
+	return 0; 
+} 
+

All_Sortings/quick.c

@@ -0,0 +1,49 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+void swap(int *a,int x,int y)
+{
+	int t=a[x];
+		a[x]=a[y];
+		a[y]=t;
+}
+
+void quick(int *a,int low,int high)
+{
+	if(low>=high)
+	return;
+
+	int mid=(low+high)/2;
+	swap(a,low,mid);
+	int last=low;
+
+	for(int i=low+1;i<high;i++)
+	{
+		if(a[i]<a[low])
+		{
+			last=last+1;
+			swap(a,i,last);
+		}
+	}
+
+	swap(a,low,last);
+	quick(a,low,last-1);
+	quick(a,last+1,high);
+}
+
+void main()
+{
+	int *a,i,n;
+	printf("Enter n : ");
+	scanf("%d",&n);
+	a=(int *)malloc(n*sizeof(int));
+	for(i=0;i<n;i++)
+	scanf("%d",&a[i]);
+
+	quick(a,0,n);
+
+	printf("Sorted Array : ");
+	for(i=0;i<n;i++)
+	printf("%d ",a[i]);
+}
+

All_Sortings/selection.c

@@ -0,0 +1,38 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+void selection(int *a,int n)
+{
+	int i,j;
+	for(i=0;i<n-1;i++)
+	{
+		int small=a[i];
+		int pos=i;
+
+		for(j=i+1;j<n;j++)
+		if(small>a[j])
+		{
+			small=a[j];
+			pos=j;
+		}
+
+		a[pos]=a[i];
+		a[i]=small;
+	}
+}
+
+void main()
+{
+	int *a,i,n;
+	printf("Enter n : ");
+	scanf("%d",&n);
+	a=(int *)malloc(n*sizeof(int));
+	for(i=0;i<n;i++)
+	scanf("%d",&a[i]);
+
+	selection(a,n);
+
+	printf("Sorted Array : ");
+	for(i=0;i<n;i++)
+	printf("%d ",a[i]);
+}

C++/WaveletTree.cpp

@@ -0,0 +1,130 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define gc getchar_unlocked
+#define fo(i,n) for(i=0;i<n;i++)
+#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
+#define ll long long
+#define si(x)	scanf("%d",&x)
+#define sl(x)	scanf("%lld",&x)
+#define ss(s)	scanf("%s",s)
+#define pi(x)	printf("%d\n",x)
+#define pl(x)	printf("%lld\n",x)
+#define ps(s)	printf("%s\n",s)
+#define deb(x) cout << #x << "=" << x << endl
+#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
+#define pb push_back
+#define mp make_pair
+#define F first
+#define S second
+#define all(x) x.begin(), x.end()
+#define clr(x) memset(x, 0, sizeof(x))
+#define sortall(x) sort(all(x))
+#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
+#define PI 3.1415926535897932384626
+typedef pair<int, int>	pii;
+typedef pair<ll, ll>	pl;
+typedef vector<int>		vi;
+typedef vector<ll>		vl;
+typedef vector<pii>		vpii;
+typedef vector<pl>		vpl;
+typedef vector<vi>		vvi;
+typedef vector<vl>		vvl;
+int mpow(int base, int exp); 
+void ipgraph(int m);
+void dfs(int u, int par);
+const int mod = 1000000007;
+const int N = 3e5, M = N;
+//=======================
+const int MAX = 1e6;
+vi g[N];
+int a[N];
+struct wavelet_tree{
+	#define vi vector<int>
+	#define pb push_back
+	int lo, hi;
+	wavelet_tree *l, *r;
+	vi b;
+
+	//nos are in range [x,y]
+	//array indices are [from, to)
+	wavelet_tree(int *from, int *to, int x, int y){
+		lo = x, hi = y;
+		if(lo == hi or from >= to) return;
+		int mid = (lo+hi)/2;
+		auto f = [mid](int x){
+			return x <= mid;
+		};
+		b.reserve(to-from+1);
+		b.pb(0);
+		for(auto it = from; it != to; it++)
+			b.pb(b.back() + f(*it));
+		//see how lambda function is used here	
+		auto pivot = stable_partition(from, to, f);
+		l = new wavelet_tree(from, pivot, lo, mid);
+		r = new wavelet_tree(pivot, to, mid+1, hi);
+	}
+
+	//kth smallest element in [l, r]
+	int kth(int l, int r, int k){
+		if(l > r) return 0;
+		if(lo == hi) return lo;
+		int inLeft = b[r] - b[l-1];
+		int lb = b[l-1]; //amt of nos in first (l-1) nos that go in left 
+		int rb = b[r]; //amt of nos in first (r) nos that go in left
+		if(k <= inLeft) return this->l->kth(lb+1, rb , k);
+		return this->r->kth(l-lb, r-rb, k-inLeft);
+	}
+
+	//count of nos in [l, r] Less than or equal to k
+	int LTE(int l, int r, int k) {
+		if(l > r or k < lo) return 0;
+		if(hi <= k) return r - l + 1;
+		int lb = b[l-1], rb = b[r];
+		return this->l->LTE(lb+1, rb, k) + this->r->LTE(l-lb, r-rb, k);
+	}
+
+	//count of nos in [l, r] equal to k
+	int count(int l, int r, int k) {
+		if(l > r or k < lo or k > hi) return 0;
+		if(lo == hi) return r - l + 1;
+		int lb = b[l-1], rb = b[r], mid = (lo+hi)/2;
+		if(k <= mid) return this->l->count(lb+1, rb, k);
+		return this->r->count(l-lb, r-rb, k);
+	}
+	~wavelet_tree(){
+		delete l;
+		delete r;
+	}
+};
+int main()
+{
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	srand(time(NULL));
+	int i,n,k,j,q,l,r;
+	cin >> n;
+	fo(i, n) cin >> a[i+1];
+	wavelet_tree T(a+1, a+n+1, 1, MAX);
+	cin >> q;
+	while(q--){
+		int x;
+		cin >> x;
+		cin >> l >> r >> k;
+		if(x == 0){
+			//kth smallest
+			cout << "Kth smallest: ";
+			cout << T.kth(l, r, k) << endl;
+		}
+		if(x == 1){
+			//less than or equal to K
+			cout << "LTE: ";
+			cout << T.LTE(l, r, k) << endl;
+		}
+		if(x == 2){
+			//count occurence of K in [l, r]
+			cout << "Occurence of K: ";
+			cout << T.count(l, r, k) << endl;
+		}
+	}
+	return 0;
+}