Firefox has been the favourite browser of many users like me in spite of the fastest growth of Chrome. Many users move from FF to Chrome for its speed and light-weight. Now, as a strategy to defend that, I've seen that FF is continuously releasing new versions since end of June . Through this releases, FF has become more light-weight browser than its previous versions. Some may complain that FF is copying Chrome. but I would say what do u expect guys. Light-weighting should come in either way. So, here it's coming in FF....
I have implemented radix and counting sorts in this program where i take inputs as the number of the numbers you want to sort and the number of digits(at max). Then the numbers, which will be sorted, are taken as random and sorted according to the corresponding algorithm. Take a look at the C-Code. Radix and Counting Sort #include<stdio.h> #include<time.h> #include<stdlib.h> #include<math.h> void count_sort(int num[],int sortd[],int no,int rng); void show(int inp[],int no); void radixsort(int...
Problem is Magicka on Google CodeJam 2011. I have solved it in a iterative way. Look at it. Magicka Problem - CodeJam'2011 #include<stdio.h> #include<string.h> char combo[36][4],opps[28][3]; int c,d; char base[]="QWERASDF"; int search_combo(char buff[],char *tmp); int search_opps(char inp[]); char* strReverse(char* str) { int i=0,j=0; while(str[j] != '\0') j++; j--;...
Problem is Bot Trust on Google CodeJam 2011.
I have solved the problem in C-language. The algorithm is pretty simple. If anyone want to know in details,please let me know by commenting on this post, I’ll post the details.
Here’s the C-Code:
Bot Trust Problem#include<stdio.h>
#include<string.h>
int search_pos(char seq[],int rbt,int indx)
//Searches the next position of 'rbt' Robot
//after 'index' in the sequence
{
int i,val=-1;char robot;
if(rbt==1) robot='O'; else robot='B';
for(i=indx;seq[i]!='\0';i++)
...
Now we will broadly discuss the Algorithm and C-code. What is Saddle Point of a Matrix? Saddle Point in a Matrix is the point which has the highest value in the respective row and lowest value in the respective column or vice-versa( i.e Lowest in a row and highest in a column). The code here first takes the Matrix as input.Then shows the matrix to the user. Then it evaluates the saddle points. Evaluation: First we evaluate the maximum and minimum of a row. If they are not equal that means they may be a candidate...
This Program-code finds the time required to find the nth Fibonacci no. using recursive algorithm. This program takes no input and outputs .xls file in which the nth Fibonacci no. with the time to compute that is written Fibonacci no. with Recursion #include<stdio.h> #include<time.h> int fibonacci(int i); int main() { time_t t1,t2; int i,no,fib; FILE *fp; fp=fopen("fibo.xls","w"); if(fp==NULL) { printf("ERROR IN FILE OPENNING\n"); exit(1);...
