Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>As others wrote, the complexity of the best algorithm is <code>O(n)</code>, especially since your array is not sorted.</p> <p>To make the search faster, you could subdivide the array and scan each portion separately in <strong>separate threads</strong>. This would scale linearly with the number of CPU cores you have available on your machine.</p> <p>If, for example, you have four cores available, then spawn four threads and let each thread scan one fourth of the array.</p> <p>Probably this discussion might help: <a href="http://www.dreamincode.net/forums/topic/245694-using-threads-to-reduce-array-search-time/" rel="nofollow">Using threads to reduce array search time</a></p> <hr> <p>In any case (and this is true for any performance related issues), you should profile your code. Create a test case for the approach you have, measure the time it takes and take this as a baseline. Then, for each modification you do, redo the measurement to check if it really improves the execution time. Also make sure to do each measurement more than once (within the same test case) and calculate the average, to reduce caching and other warming up effects (ideally, execute the code at least once before starting the first measurement).</p> <p>This is Java related, but gives some good feedback that it does not in all cases make sense to parallelize: <a href="http://www.youtube.com/watch?v=DCdGlxBbKU4&amp;feature=player_embedded" rel="nofollow">A Beginner´s Guide to Hardcore Concurrency</a></p>
    singulars
    1. This table or related slice is empty.
    1. POC++ What is the fastest way to scan for certain elements within a unsigned char array and a unsigned char vector?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USAndreas Fester
    1. USAndreas Fester
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POC++ What is the fastest way to scan for certain elements within a unsigned char array and a unsigned char vector?
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COOkay, how about this idea: Make a copy of Array and sort it then count? Then delete the copied Array. Why make a copy? The reason is because we need to keep the original content.
      singulars
      1. PO
      1. USCLearner
    2. CO@CLearner You would, in addition, have the overhead of sorting, which is even [more than O(n)](http://stackoverflow.com/questions/962545/on-log-n-complexity-similar-to-linear)
      singulars
      1. PO
      1. USAndreas Fester
    3. COThreads sounds like a good idea!
      singulars
      1. PO
      1. USCLearner
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload