@AdnanTurjoy

#include<stdio.h> int partition(int a[], int low, int high){ int pivot = a[low]; int i = low; int j = high; while(i<j){ while(a[i]<=pivot){ i++; }

/// Insert Sort #include<iostream> using namespace std; int main() { int i,a[]= {3,6,2,9,1,4,7,5},temp,ck,j,k; int n; n=sizeof(a)/sizeof(a[0]); for(i=1;i<n;i++){ temp=a[i];

import java.util.*; import java.lang.*; import java.io.*; public class car{ void run(){ System.out.println("car is running"); } }

class A5{ void m(){ System.out.println(this);//prints same reference ID } public static void main(String args[]){ A5 obj=new A5(); System.out.println(obj);//prints the reference ID obj.m(); } }

#include<stdio.h> int main() { int a[4]={5,4,7,9}; int *pt; pt=&a; printf("Address of 1st element of ARRAY a = %d\n",pt); printf("Value of 1st element of ARRAY a =%d\n",*pt); printf("Value of pt[0],pt[1],pt[2],pt[3] = %d %d %d %d\n",pt[0],pt[1],pt[2],pt[3]);

#include <stdio.h> int main() { int a[7]={22,2,6,7,8},i=2; //pt=a; while(i<5){ printf("%d",*(a+i)); i++;} return 0;

#include<stdio.h> int binary_search(int a[], int search, int low, int high){ while(low<=high){ int mid = (low+high)/2; if(a[mid]==search) return mid; else if(a[mid]>search) { high=mid-1; } else{ low= mid+1;

// Binary Search in C #include <stdio.h> int binarySearch(int array[], int x, int low, int high) { // Repeat until the pointers low and high meet each other while (low <= high) { int mid = (low + high) / 2; if (array[mid] == x)

#include <stdio.h> int main() { int n1, n2, i, gcd; printf("Enter two integers: "); scanf("%d %d", &n1, &n2); for(i=1; i <= n1 && i <= n2; ++i) {

#include<stdio.h> int main() { int n,i,k,s=0; scanf("%d",&n); k=n; for(i=1;i<n-1;i++){ int rem = n % i; /// total factor gula jog korlei hobe if(rem ==0) {

#include <stdio.h> #include <string.h> int main(){ char string1[20]; int i, length; int flag = 0; printf("Enter a string:"); scanf("%s", string1);

#include<stdio.h> int main() { int n,p_sum=0,dup; scanf("%d",&n); dup= n; while(n>0){ int rem = n%10; int div = n/10;

#include<stdio.h> int main() { int n; scanf("%d",&n); while(n>0){ int rem = n%10; printf("%d",rem); int div = n/10;

#include <iostream> using namespace std; int hcf(int n1, int n2); int main() { int n1, n2;

#include<stdio.h> int fact(int n){ if(n==0 || n==1){ return n; } else{ return n*fact(n-1); } }

/// nth position fibonacchi #include<stdio.h> int fibo(int n){ if(n<=1){ return n; } else{ return fibo(n-1) + fibo(n-2); } }

#include<stdio.h> int main() { int a=0,b=1,s=0,i=0,n,sum=1; scanf("%d",&n); printf("%d ,%d ,",a,b); while(i<n-2){ /// 2 ta pod age thekei cilo(first and second pod) s=a+b;

/// Merge Sort #include<iostream> using namespace std; void merge(int a[],int L[],int lcount,int R[],int rcount) { int i=0,j=0,k=0; while(i<lcount && j<rcount) { if(L[i]<R[j]) a[k++]=L[i++];

/// Selection Sort #include<iostream> using namespace std; int main() { int i,a[]= {3,6,2,9,1,4,7,5},temp,min,j,k; int n; n=sizeof(a)/sizeof(a[0]); for(i=0;i<n-1;i++){

#include<stdio.h> int main() { int a[10],i,j,k,temp; for(i=0;i<5;i++) scanf("%d",&a[i]); for(i=0;i<5;i++){ for(j=0;j<4;j++){ if(a[j]>a[j+1]){ temp=a[j]; a[j]=a[j+1];