Search:
Type: Posts; User: irpersian20
Search:
Search took 0.01 seconds.

Unfortunately, I don't understand it :(
I want know what the function time complexity ?
http://forums.codeguru.com/attachment.php?attachmentid=32665&d=1401537827
O(n) ?
O(nlogn)??
O(logn)???...


Hi,
Which time complexity is true?
O(n)
O(nlogn)
O(logn)
O(2^n/2)
32665

November 26th, 2013, 11:44 AM
The comparison operators, if overloaded, must be overloaded in pairs; that is, if == is overloaded, != must also be overloaded. The reverse is also true, and similar for < and >, and for <= and >=.
...

September 27th, 2013, 12:07 AM

September 26th, 2013, 09:03 AM
Hi,
I want write a simple calculator without any priority but i have problem with this. :(
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using...

September 22nd, 2013, 03:33 AM
I can't write any code :( .. I need one idea for solve the problem.

September 22nd, 2013, 01:03 AM
Yes,I need help.
Please see the pdf file(attached) . i want fill array with the following pattern in pdf.

September 21st, 2013, 03:53 PM
Hi.
I want to solve the following exercises with four different arrays.
int[] a;
int[] b;
int[] c;
int[] d;
Please see the pdf file.
Thank you

Dear my friend
It's not my homework.
Sample test questions , could not find an appropriate solution

Use the divideandconquer approach to write a recursive algorithm that finds the maximum sum of two consecutive elements in an array.
For example:
1)3,7,1,6,9,2,3
6+9=15
Maximum of two...

For example:
3,7,1,6,9,2,3
6+9=15
Maximum of two elements together

Hello,
What are your ideas to solve the following problem?
Divide and conquer method
Algorithm to find the two consecutive elements in an array of n elements is the sum of the maximum

April 9th, 2012, 07:26 AM
Hello,
What is the time complexity T(n) of the nested loops below? For simplicity, you may assume that n is a power of 2. That is, n = 2k for some positive integer k.
:
for (i = 1; i...

March 19th, 2012, 12:32 PM
// input: an array of size n
isHeap(array h, index i) {
if(i > n/2) return true; //base case
if(h[i*2+1]!= null) {
if((h[i] >= h[i*2]) && (h[i] >= h[i*2+1]))

March 17th, 2012, 03:55 PM
Write an algorithm that determines whether or not an almost complete binary tree is a heap.

March 17th, 2012, 03:09 PM
ok,excuse me
but can you help me?

March 17th, 2012, 02:50 PM
Hi,
Write an algorithm that determines whether or not an almost complete binary tree is a heap.
Please

March 17th, 2012, 02:49 PM
Hi,
Write that determines whether or not an almost complete binary tree is a heap.
Please

Click Here to Expand Forum to Full Width
This is a CodeGuru survey question.
Featured
