Professional Documents
Culture Documents
Daalabrecord (6) Programs
Daalabrecord (6) Programs
if ( p<q )
{
j = partition( a, p, q );
// ...Student-to-write-code-here... to sort i-part of
pivot item (use recursion)
quicksort( a, p, j-1 );
// ...Student-to-write-code-here... to sort j-part of
pivot item (use recursion)
quicksort( a, j+1, q );
}
} //end quicksort
if ( i< j)
{ interchange(a,i,j); }
}
// j is final position for the pivot
a[m] = a[j];
a[j] =v ;
return j;
}
void printArray(int a[], int n)
{
int i;
for (i=0; i<n; i++)
System.out.print(" "+a[i]);
}//end printarray
}
public class Quick_sort
{
int n, i;
/* Accept number of elements */
System.out.println("Enter number of integer elements");
n = scan.nextInt();
/* Create array of n elements */
int arr[] = new int[n];
/* Accept elements */
System.out.println("\nEnter "+ n +" integer elements");
for (i = 0; i < n; i++)
arr[i] = scan.nextInt();
/* Call method sort */
Qsort ob = new Qsort();
ob.quicksort(arr, 0, arr.length-1);
System.out.println("\nSorted array");
ob.printArray(arr,n);
import java.util.*;
helper[i] = array[i];
array[current] = helper[helperLeft];
helperLeft++;
}else{
array[current] = helper[helperRight];
helperRight++;
}
current ++;
for(int i=0;i<arr.length;i++)
System.out.print(arr[i]+" ");
System.out.println();
int n=sc.nextInt();
arr[i]=sc.nextInt();
ob.mergeSort(arr,0,n-1);
ob.printArray(arr);
BFS program
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
class BFS
public BFS()
}
public void bfs(int adjacency_matrix[][], int source)
int i,element;
visited[source] = 1;
queue.add(source);
while (!queue.isEmpty())
element = queue.remove();
i = element;
System.out.print(i + "\t");
queue.add(i);
visited[i] = 1;
}
i++;
DFS program
import java.util.InputMismatchException;
import java.util.Scanner;
import java.util.Stack;
public DFS()
int i = source;
System.out.print(element + "\t");
visited[source] = 1;
stack.push(source);
while (!stack.isEmpty())
element = stack.peek();
i = element;
stack.push(i);
visited[i] = 1;
element = i;
i = 1;
System.out.print(element + "\t");
continue;
}
i++;
stack.pop(); }
import java.util.Scanner;
class SumOfSubsets {
int[] w;
int[] x;
int sum,n;
int total = 0;
SumOfSubsets()
n = sc.nextInt();
}
boolean issafe()
w[i] = sc.nextInt();
total += w[i];
sum = sc.nextInt();
return false;
return true;
int i = 0;
x[k] = 1;
if (s + w[k] == sum) {
x[k] = 0;
sumofsubsetUtil(s, k + 1, r - w[k]);
void solveSum()
if(issafe()==false)
sumofsubsetUtil(0, 1, total);
class Main
{
int N=8,count=0;
static int x[]=new int[8];
int place(int k,int i,int x[])
{
int j;
for(j=0;j<k;j++)
{
if(i==x[j] || abs(k-j)==abs(i-x[j]))
return 0;
}
return 1;
}
void Nqueen(int k)
{
int i,j;
for(i=0;i<N;i++)
{
if(place(k,i,x)==1)
{
x[k]=i;
if(k==N-1)
{
count++;
for(j=0;j<=k;j++) System.out.print(x[j]+" ");
System.out.println();
}
else
Nqueen(k+1);
}
}
public static void main (String[] args)
{
Main o= new Main();
o.Nqueen(0);
System.out.println("Total "+o.count+" solutions are possible\n");
}
}
new SumOfSubsets().solveSum();
}