Search:

OReubens, to know algo of hashing & to know how to crack the given hash are slightly different things, at least ;)

Z80, scores must be based upon tests before hiring + they get corrected along work. So, if someone considers "Hello World" as advanced level of C/C++, it will be easily debunked ;) + it's good to...

Razzle, let's be on topic, Please, w/o funny personal assaults. If you have something to defend your point -- share it, otherwise it's better to keep Silence ;) Actually, i'd like to see HOW-TO deal...

2kaud, any question about IT may be based upon illegal intentions :) So, would you like to investigate each one??? Normally opted security is quite strong against even most sophisticated invaders,...

Mokaro, Everything depends upon hashing algo. But common thing here is infinite number of solution for each given hash. Meantime, well-dev'ed hash-func restricts the length of input string, therefore...

Taboo to research encryption :confused:

#1 NP-complete, in most of cases, means NO-SOLUTION AT ALL, the're Just no computing muscle to run such kind of things. But we must keep in mind that NPC is very child of lack of data. So i urgently...

@Razzle

oh, such fearful term "NP-complete" :D for most cases, it's quite possible to develop statistical model w/o so dramatic complexity :rolleyes:

db is database.

i don't fully agree w/ you about subjective measurements: any measurement is only approximation of real value. the more data of person you have, the more accurate estimation upon...

such problem has no clear optimization per se. Ye Just may run db w/ scores of each employee & h(is/er) current task + each task must be rated too, for capability to re-flow resources from...

by the way, algo is faulty: it has to control a[i] < sum + 1, otherwise gets a jump to nowhere. ;)

huh, something became a bit clear :)

Array "b" is used to count how many subsets of array "a" give the needful number:



if(b[j])
b[j+a[i]]+=b[j]; //occurence of variety of addition not...

Larry, that algo is the really working? i didn't try it, frankly. But such speed seems very intriguing. well, i'll dig in & ans as soon as possible. :)

yes, it's bad, but something says me that Topic Starter has solved his question :rolleyes: + i don't know what else can be said on topic. i think it may be only the cadging to write a code from...

i don't know hardware-independent algos :rolleyes: even java codes, js, php.. are only theoretically portable things. :D

have you been running that code step by step??? Actually, 'tis the best approach to figure out how stuff works. Meanwhile, i suspect aforementioned algo ain't well-written. Just recall that your...

programmer must understand the limits of abstraction clearly, otherwise it's impossible to develop efficient algorithms. i think you can recall an example or two, where algos of equal mathematical...

hardware-independent algos don't exist in our furious & crafty World :rolleyes: You can develop quite portable thing, but performance will be very shy.

well, let's try to run example. let's we have a tree of 3 nodes (root, left, right), our node looks like:


#include <stdio.h>
struct NODE{
NODE *left;
NODE *right;
int index;
}node;
NODE...

tree ain't good enough to provide random access to items(nodes) for O(1). So to provide fast operations need to use memory-gobbling strategy:

1. Tree must be gotten to provide fast SEARCH, REMOVE,...

Razzle, not sure what structure you do mean. if 'tis array, then term "remove" ain't good -- array gonna contain "0"s & "1"s as well. i think better off to deal w/


NODE{
NODE *parent;
NODE...

Set has 2^n of subsets. I.e. any element of main set either exists or not in given subset. So algo just mask++. For instance, mask ={0,0,0} & set={1,2,3}, then we get subset0=mask & set = {}. Let's...

in fact, w/o fully restricted bounds of buffers, you cannot avoid the problem entirely. For instance, canaries are useful to detect overflows. But such safe code ain't reliable because you just face...

that's exactly what DaBOFi does do. Actually, very question is to provide clear scheme of protection with lowest performance penalty of possible ones. DaBOFi deals w/ 3 parameters:

1. base of...

your words are right for everything :rolleyes: check out the problems stack/heap overflow, that's all about buffer overflow. ;) it has pounded C/C++ & c-like languages for decades.