No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
unfortunately following code returns zero as output [CODE]#include<iostream> #define MAX 100 using namespace std; int graph[MAX][MAX]; int queue[MAX]; int head,tail; int parent[MAX]; int V,E; int s,t,fTotal; int F[MAX][MAX]; //breadth First search bool reachable(int s,int t){ bool found=false; head=tail=0; int vq; memset(parent,255,sizeof(parent)); queue[tail++]=s; parent[s]=s; while(head< tail && ! found){ vq=queue[head++]; for(int … |
|
|
hi i have write LSD radix sort but it does not work can anybody help me? here is code public class LSD{ public static int R=1<<8; public static int bytesword=4; public static void radixLSD(int a[],int l,int r){ int aux[]=new int[a.length]; for (int d=bytesword-1;d>=0;d--){ int i, j; int count[]=new int[R]; for … 
|