-
1 some
1. pronoun, adjective1) (an indefinite amount or number (of): I can see some people walking across the field; You'll need some money if you're going shopping; Some of the ink was spilt on the desk.) šiek tiek, truputis2) ((said with emphasis) a certain, or small, amount or number (of): `Has she any experience of the work?' `Yes, she has some.'; Some people like the idea and some don't.) šiek tiek; kai kurie3) ((said with emphasis) at least one / a few / a bit (of): Surely there are some people who agree with me?; I don't need much rest from work, but I must have some.) nors vienas, nors kas4) (certain: He's quite kind in some ways.) kai kuris2. adjective1) (a large, considerable or impressive (amount or number of): I spent some time trying to convince her; I'll have some problem sorting out these papers!) nemažai, ganėtinai2) (an unidentified or unnamed (thing, person etc): She was hunting for some book that she's lost.) kažkoks3) ((used with numbers) about; at a rough estimate: There were some thirty people at the reception.) maždaug, apie3. adverb((American) somewhat; to a certain extent: I think we've progressed some.) kažkiek, šiek tiek- somebody- someday
- somehow
- someone
- something
- sometime
- sometimes
- somewhat
- somewhere
- mean something
- or something
- something like
- something tells me
См. также в других словарях:
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
Sorting network — A sorting network is an abstract mathematical model of a network of wires and comparator modules that is used to sort a sequence of numbers. Each comparator connects two wires and sort the values by outputting the smaller value to one wire, and a … Wikipedia
Pancake sorting — is a variation of the sorting problem in which the only allowed operation is to reverse the elements of some prefix of the sequence. Unlike a traditional sorting algorithm, which attempts to sort with the least comparisons possible, the goal is… … Wikipedia
Bin packing problem — In computational complexity theory, the bin packing problem is a combinatorial NP hard problem. In it, objects of different volumes must be packed into a finite number of bins of capacity V in a way that minimizes the number of bins used.There… … Wikipedia
Topological sorting — Dependency resolution redirects here. For other uses, see Dependency (disambiguation). In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge uv, u comes… … Wikipedia
External sorting — is a term for a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted does not fit into the main memory of a computing device (usually RAM) and a slower kind of memory… … Wikipedia
Dutch national flag problem — Dutch national flag redirects here. For the flag, see Flag of the Kingdom of the Netherlands. The Dutch national flag problem is a famous computer science related programming problem proposed by Edsger Dijkstra. The flag of the Netherlands… … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Year 10,000 problem — The Year 10,000 problem, or Y10K, is the class of all potential software bugs that may emerge should the need to express years with five digits arise. The problem can have discernible effects today, but is also sometimes mentioned because of its… … Wikipedia
Birthday problem — In probability theory, the birthday problem, [This is not a paradox in the sense of leading to a logical contradiction, but is called a paradox because the mathematical truth contradicts naïve intuition: most people estimate that the chance is… … Wikipedia
Klee's measure problem — In computational geometry, Klee s measure problem is the problem of determining how efficiently the measure of a union of (multidimensional) rectangular ranges can be computed. Here, a d dimensional rectangular range is defined to be a cartesian… … Wikipedia
