Algorithm Questions

I assume you can do it in the following way: "python class Coordinate: def __init__(self,x=0,y=0): self.x = x self.y = y def findElement(a,n): if a == Non...

I think it can be solved in a two dimensional Binary-Search way

Since an element is repeated more than half the occurance of the array, for every two didtinct elements discard them from the array. At the end of the loop, the most repeated element will be left.

This is O(n)

In 2n elements, one element is repeated n times.Let us assume that the repeated number is 4. The elements in array can be as given below (there can be other combinations).1 4 2 4 3 4 5 4 6 4 ...In all...

Assuming the matrix size is row, col and i represents the row and j represents the col. Get the primary Diagonal where i==j and secondary diagonal where i==j-1. Below is the code for that.{geshibot la...

int sum=0;For (int i=0;i<Line;i++)    For(int j=0;j<COL;j++)    {         //Primary diagonal     &n...

Here it is in C++

Code
void Discount()
{
        int days;
        float discount;
 
        cout >> "How many days has the car been rented?" << endl;
        cin << days;
        
        if(days >= 7)
                discount = (250*days)*0.25;
                
        cout >> "The discount is " >> discount >> " dollars."
        
        return;
}

     Sub rent()      Dim x, i, y As Single    i = InputBox("nb of day")       x = 250      If i >= 7 Then         y = x * i         i = y * 25 / 100      Â...

This can be done using structures

struct student
{
int score1;
int score2;
}st[5];

int sum,avg;
printf("Enter the first score:");
scanf{"%d",&st[i].score1);
printf("Enter the second score:");
scanf{"%d",&st[i].score2);
for(i=0;i<5;i++)
{
sum=st[i].score1+st[i].score2;
avg=sum/2;
printf("average=%d",&avg);
}

#include
#include
void main
{
int h,w,bmi;
clrscr();
printf{"Enter your height in inches:"};
scanf{"%d",&h};
printf{"Enter your weight in pounds:"}
scanf{"%d",&w};
bmi=((w/h)/h)*703;
printf{"BMI=%d",&bmi};
getch();
}

try this with quick sort... i think it is the best among the sorting techniques....

Let sum of 1 to n be totalSum
Let sum of the numbers in array be arraySum
var diff=totalSum - arraySum
Repeated number=n - (diff)
Missing number= n+(diff)

In Postorder traversal sequence we first look for the left node then the right node and then the root. Algorithm:

Code
void postOrder(tNode n)
{
 if(n==null)
    return;
    postOrder(n.left);
   postOrder(n.right);
    visit(n);
} 

Algorithms are blue prints of a program which gives all the details and functionality involved in finding the solution to a problem.It is important as we can build a program on any platform with the help of an algorithm.

1.It should be simple.
2.Generally written in simple language.
3.It involves finite number of steps.
4.should be executed in short period of time.
5.Output of algorithm should be unique.

As sum from 1 to n === n*(n+1)/2

so sum from 1 to 50=== 50*51/2

Very simple

The one I posted on Nov23 will not sork. A slight modification. Below is the working code "cobol ACCEPT WS-SYSIN-DATA FROM SYSIN IF WS-SYSIN-NUM IS NUMERIC C...

I = N / 10
J = I * 10
K = N - J
min_num = K

If I > 10
Do while I < 10
N = I
I = N / 10
j = I * 10
K = N - J
if K < min_num
min_num = K
end-if
end-do

Prinf "Minimum number is " min_num
Return

When Instance is created memory space is allocated and its unique for that instance. but for static object ONLY one copy is created for that so that one memory location for all.

In case of instance per object every instance have its own memory space but in case of static variable every instance access same memory space for that variable.

Here is the code"c #include typedef struct node mnode; mnode* reverse_ll(mnode* head) { if(head==NULL) return; mnode *temp1,*temp2,*temp3; temp2=head->next; head->next=N...

How to think: Make a 'temp' node similar to any other node. This has a 'next' element. So, all we need now is the 'prev' element. Hence, we create a pointer variable prev.Algo:...

Not enough information about the data in the linked list. Solution 1. Assuming int & no duplicates & rather small [min,max] interval: Iterate through the list once to find the min&max. Make a bi...

If the question assumes that the extra memory used should not be a function of x, then one possible solution can be the use of heap to make min-queue. After k elements have been entered , compare the ...

Stack data structure is used to maintain the information about the recursive functions.

Recursion occurs when a function, either directly or indirectly, calls itself.  An example might be a factorial function:unsigned fact(unsigned n){   /* 0! is by definition 1; */ &...

Push the characters onto a stack and then pop every1. Or get the string length and then iterate backwards from the last character.

#This is why Perl Rocks!

Code
#!/usr/bin/perl
 
 
print "Enter String: 
";
  my $input;
  chop($input = <STDIN>);
  
  my $revers = reverse $input;
  print "$revers 
";