Geek asks and answers

Short list of employees

I have n numbers of things in the queue, and I need to find the best things against the open categories of criteria C {X, YZ) (here X, Y, Z are variants of C). What would be the best proposed general algorithm with the least time complexity?

For instance:

Suppose a company sends a job in C ++, C, banking domain, STL, 5-10 years ... so on. 100 people applied for the same position. Some have exp in C, some in C ++, Java. Some of them have C, C ++, telecommunication domain ... and so on. My question here is: how to find the best employee? How to rank them?

+3
source share
3 answers

, , - , () (), .

:

  • = >
  • = >
  • = >
  • = >
  • Java = > Java
  • JSE = > Java + Swing
  • J2SE = > JSE = > Java + Swing
  • RHEL = > RHEL + linux

Lucene .

+1

,

.

  • (++: 100, C: 80, 12yrs: 120, 10yrs: 100, 8yrs: 80, 5yrs: 0 ..).
  • , .
  • .

,  -  -  - /  - /

( ),  - ,  - , ? - :)

+1

, , , , . : : Java, SQL, PHP (3 ), emplyoyee exp PHP Java (2 ) r : r = (employee_items) / (total_items) = 2 / 3
, . , , Java - ​​ 1.5, SQL normal - 1 PHP 0.8. employee_items 1.5 * 1 + 0.8 * 1

0

More articles:


All Articles