Search Results

Search found 9062 results on 363 pages for 'big empin'.

Page 24/363 | < Previous Page | 20 21 22 23 24 25 26 27 28 29 30 31  | Next Page >

• O(log N) == O(1) - Why not?

  - by phoku

  Whenever I consider algorithms/data structures I tend to replace the log(N) parts by constants. Oh, I know log(N) diverges - but does it matter in real world applications? log(infinity) < 100 for all practical purposes. I am really curious for real world examples where this doesn't hold. To clarify: I understand O(f(N)) I am curious…

  Read the article

• Time complexity O() of isPalindrome()

  - by Aran

  I have this method, isPalindrome(), and I am trying to find the time complexity of it, and also rewrite the code more efficiently. boolean isPalindrome(String s) { boolean bP = true; for(int i=0; i<s.length(); i++) { if(s.charAt(i) != s.charAt(s.length()-i-1)) { bP = false; } } return bP; } Now I…

  Read the article

• What order of time does the .NET System.String.Length property take?

  - by Matthew

  I had someone advise me to avoid repeatedly calling String.Length, because it was recalculated each time I called it. I had assumed that String.Length ran in O(1) time. Is String.Length more complex than that?

  Read the article

• Python: (sampling with replacement): efficient algorithm to extract the set of UNIQUE N-tuples from a set

  - by Homunculus Reticulli

  I have a set of items, from which I want to select DISSIMILAR tuples (more on the definition of dissimilar touples later). The set could contain potentially several thousand items, although typically, it would contain only a few hundreds. I am trying to write a generic algorithm that will allow me to select N items to form an N-tuple, from the…

  Read the article

• Linear time and quadratic time

  - by jasonline

  I'm just not sure... If you have a code that can be executed in either of the following complexities: (1) A sequence of O(n), like for example: two O(n) in sequence (2) O(n²) The preferred version would be the one that can be executed in linear time. Would there be a time such that the sequence of O(n) would be too much and that O(n²) would…

  Read the article

• Given a number N, find the number of ways to write it as a sum of two or more consecutive integers

  - by hilal

  Here is the problem (Given a number N, find the number of ways to write it as a sum of two or more consecutive integers) and example 15 = 7+8, 1+2+3+4+5, 4+5+6 I solved with math like that : a + (a + 1) + (a + 2) + (a + 3) + ... + (a + k) = N (k + 1)*a + (1 + 2 + 3 + ... + k) = N (k + 1)a + k(k+1)/2 = N (k + 1)*(2*a + k)/2 = N Then…

  Read the article

• The limits of parallelism

  - by psihodelia

  Is it possible to solve a problem of O(n!) complexity within a reasonable time given infinite number of processing units and infinite space? The typical example of O(n!) problem is brute-force search: trying all permutations (ordered combinations).

  Read the article

• Link failure with either abnormal memory consumption or LNK1106 in Visual Studio 2005.

  - by Corvin

  Hello, I am trying to build a solution for windows XP in Visual Studio 2005. This solution contains 81 projects (static libs, exe's, dlls) and is being successfully used by our partners. I copied the solution bundle from their repository and tried setting it up on 3 similar machines of people in our group. I was successful on two machines…

  Read the article

• Python: (sampling with replacement): efficient algorithm to extract the set of DISSIMILAR N-tuples from a set

  - by Homunculus Reticulli

  I have a set of items, from which I want to select DISSIMILAR tuples (more on the definition of dissimilar touples later). The set could contain potentially several thousand items, although typically, it would contain only a few hundreds. I am trying to write a generic algorithm that will allow me to select N items to form an N-tuple,…

  Read the article

• Algorithm to determine if array contains n...n+m?

  - by Kyle Cronin

  I saw this question on Reddit, and there were no positive solutions presented, and I thought it would be a perfect question to ask here. This was in a thread about interview questions: Write a method that takes an int array of size m, and returns (True/False) if the array consists of the numbers n...n+m-1, all numbers in that range…

  Read the article

• Finding smallest angle between vectors in logarithmic time.

  - by Christian

  I have n=10000 10 dimensional vectors. For every vector v1 I want to know the vector v2 that minimizes the angle between v1 and v2. Is there a way to solve this problem faster than O(n^2)?

  Read the article

• Millionth number in the serie 2 3 4 6 9 13 19 28 42 63 ... ?

  - by HH

  It takes about minute to achieve 3000 in my comp but I need to know the millionth number in the serie. The definition is recursive so I cannot see any shortcuts except to calculate everything before the millionth number. How can you fast calculate millionth number in the serie? Serie Def n_{i+1} = \floor{ 3/2 * n_{i} } and n_{0}=2. …

  Read the article

• How do you visualize difference between O(log n) and O(n log n)?

  - by Passionate programmer

  Binary search has a average case performance as O(log n) and Quick Sort with O(n log n) is O(n log n) is same as O(n) + O(log n)

  Read the article

• Can hash tables really be O(1)

  - by drawnonward

  It seems to be common knowledge that hash tables can achieve O(1) but that has never made sense to me. Can someone please explain it? A. The value is an int smaller than the size of the hash table, so the value is its own hash, so there is no hash table but if there was it would be O(1) and still be inefficient. B. You have to…

  Read the article

• (log(n))^log(n) and n/log(n), which is faster?

  - by Soup

  f(n)=(log(n))^log(n) g(n)= n/log(n) f=O(g(n))?

  Read the article

• Sort vector<int>(n) in O(n) time using O(m) space?

  - by Adam

  I have a vector<unsigned int> vec of size n. Each element in vec is in the range [0, m], no duplicates, and I want to sort vec. Is it possible to do better than O(n log n) time if you're allowed to use O(m) space? In the average case m is much larger than n, in the worst case m == n. Ideally I want something O(n). I get the…

  Read the article

• tight (T) bound

  - by tomwu

  Can someone explain this to me? Such as this: Given a function: for k = 1 to lg(n) for j = 1 to n x=x+1 How would I analyze the tight (T) bound?

  Read the article

• Why are bugs responsible for big deficiencies in functionality given such low priority?

  - by keepitsimpleengineer

  Well, first of all, change is inevitable and mostly good. Furthermore attempts at simplifying the User Interface such as Gnome 3, Unity to make Linux more inclusive hold much promise, even though they adversely affect my style of working. Additionally, though now retired, I have worked with computers for 47 years, and though I do…

  Read the article

• Is a big name computer science degree worth the cost?

  - by Serplat

  I'm currently in High School and trying to look into what I want to do after I graduate. I know that I will be going to college, and that I want a degree in Computer Science, however, I'm not entirely sure where I want to go (I haven't started the application process yet). I already have built up a decent amount of experience in…

  Read the article

• Les américains manifestent contre l'espionnage de la NSA, ils exigent d'une seule voix de «débrancher Big Brother»

  Les américains manifestent contre l'espionnage de la NSA, ils exigent d'une seule voix de «débrancher Big Brother» Des manifestants se sont réunis en grand nombre au pied du Capitole à Washington pour protester contre les programmes de surveillance des télécommunications mis en oeuvre par la National Security Agency (NSA). Ils…

  Read the article

• The Next Big Fight: Facebook vs. Firefox?

  <b>Computerworld UK:</b> "The big announcements by Facebook last week have started alarm bells ringing around the Net. Here's the kind of thing that is sending shivers down many people's spines:"

  Read the article

• Do I need to go to a big-name university?

  - by itaiferber

  As a soon-to-be graduating high school senior in the U.S., I'm going to be facing a tough decision in a few months: which college should I go to? Will it be worth it to go to Cornell or Stanford or Carnegie Mellon (assuming I get in, of course) to get a big-name computer science degree, internships, and connections with…

  Read the article

• Do We Still Need Database Design in the Era of Big Data?

  Many big data application implementations seem to begin with an existing data warehouse, one or more new high-volume data streams, and some specialized hardware and software. The data storage issue is often accommodated by installing a proprietary hardware appliance that can store huge amounts of data while providing…

  Read the article

• What kind of process should I use to learn a big system?

  - by user394128

  I just joined a new company and started to study one of the their bigger system. For me to be productive, I need to understand the entire system without too much help. Other programers are really busy and dont' have time to hold my hands. I used to use brain map to draw a pictorial representation of the system. Any…

  Read the article

• ~/.xsession-errors is 2.7gb big (and growing), on fresh install, caused by gnome-settings-daemon errors

  - by Alex Black

  I've just installed Ubuntu 10.10 x64, activated the recommended Nvidia drivers, and I noticed my hard disk space is disappearing, I narrowed the culprit down to this: alex@alex-home:~$ ls -la .x* -rw------- 1 alex alex 4436076400 2010-11-19 22:35 .xsession-errors -rw------- 1 alex alex 10495 2010-11-19 21:46…

  Read the article

< Previous Page | 20 21 22 23 24 25 26 27 28 29 30 31  | Next Page >