Перевод: с английского на русский

с русского на английский

counting+input

Страницы

См. также в других словарях:

  • Counting sort — In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct… …   Wikipedia

  • Double counting (accounting) — Double counting in accounting is an error whereby a transaction is counted more than once, for whatever reason. But in social accounting it also refers to a conceptual problem in social accounting practice, when the attempt is made to estimate… …   Wikipedia

  • Reference counting — In computer science, reference counting is a technique of storing the number of references, pointers, or handles to a resource such as an object or block of memory. It is typically used as a means of deallocating objects which are no longer… …   Wikipedia

  • Card counting — A blackjack game in progress Card counting is a casino card game strategy used primarily in the blackjack family of casino games to determine whether the next hand is likely to give a probable advantage to the player or to the dealer. Card… …   Wikipedia

  • blast fax — n. A fax that is sent to a large number of recipients. Example Citation: Many Senate aides said their offices are counting input only from home state constituents. Senate aides said that in recent years, they have been flooded with blast faxes… …   New words

  • Intel 8253 — The Intel 8253 and 8254 are Programmable Interval Timers (PITs), which perform timing and counting functions. They are found in all x86 PCs. History In modern times, this PIT is not included as a separate chip in an x86 PC. Rather, its… …   Wikipedia

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… …   Wikipedia

  • Flip-flop (electronics) — An SR latch, constructed from a pair of cross coupled NOR gates. Red and black mean logical 1 and 0 , respectively. In electronics, a flip flop or latch is a circuit that has two stable states and can be used to store state information. The… …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Unary numeral system — The unary numeral system is the bijective base 1 numeral system. It is the simplest numeral system to represent natural numbers: in order to represent a number N , an arbitrarily chosen symbol representing 1 is repeated N times. For example,… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»