2D array sort in java
Arrays.sort(arr,(a,b) -> a[1] - b[1]);
Posts
Java code for subString printing
import java.util.*; class HelloWorld { public static void main(String[] args) { String str ="abc"; ArrayList<String> ans = new ArrayList<>(); find(str,"",ans); System.out.print(ans); } static void find(String real,String ans, ArrayList<String> res){ if(real.length()==0){ res.add(ans); return; } char ch=real.charAt(0); find(real.substring(1),ans,res); find(real.substring(1),ans+ch,res); } }
subset of array though recursion in java
class Solution{ static Boolean isSubsetSum(int N, int arr[]){ // code here ArrayList<ArrayList<Integer>> res = new ArrayList<>();// this is for storing result find(0,arr,new ArrayList<Integer>() , res); } static void find(int idx ,int[] arr , ArrayList<Integer> cur, ArrayList<ArrayList<Integer>> res){ res.add(new ArrayList<>(cur)); for(int i=idx;i<arr.length;i++){ cur.add(arr[i]); find(i+1,arr, cur , res); cur.remove(cur.get(cur.size()-1)); } } }
SubSet of array in java / subsequence of array in java
static Boolean isSubsetSum(int N, int arr[], int target){ // code here ArrayList<ArrayList<Integer>> list = new ArrayList<>(); list.add(new ArrayList<>()); for(int i=0;i<N;i++){ int n=list.size(); for(int j=0;j<n;j++){ ArrayList<Integer> temp = new ArrayList<>(list.get(j)); temp.add(arr[i]); list.add(temp); } } } return false; }
Code
#include <stdio.h> struct process { int pid; int btime; int wtime; int ttime; } p[10]; main() { int i,j,k,n,ttur,twat; float awat,atur; printf("Enter no. of process : "); scanf("%d", &n); for(i=0; i<n; i++) { printf("Burst time for process P%d (in ms) : ",(i+1)); scanf("%d", &p[i].btime); p[i].pid = i+1; } p[0].wtime = 0; for(i=0; i<n; i++) { p[i+1].wtime = p[i].wtime + p[i].btime; p[i].ttime = p[i].wtime + p[i].btime; } ttur = twat = 0; for(i=0; i<n; i++) { ttur += p[i].ttime; twat += p[i].wtime; } awat = (float)twat / n; atur = (float)ttur / n; printf("\n FCFS Scheduling\n\n"); for(i=0; i<28; i++) printf("-"); printf("\nProcess B-Time T-Time W-Time\n"); for(i=0; i<28; i++) printf("-"); for(i=0; i<n; i++) {printf("\n P%d\t%4d\t%3d\t%2d", p[i].pid,p[i].btime,p[i].ttime,p[i].wtime);} printf("\n"); printf("\n\nAverage waiting time : %5.2fms", awat...
