英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

cared    音标拼音: [k'ɛrd]
Care \Care\, v. i. [imp. & p. p. {Cared}; p. pr. & vb. n.
{Caring}.] [AS. cearian. See {Care}, n.]
To be anxious or solicitous; to be concerned; to have regard
or interest; -- sometimes followed by an objective of
measure.
[1913 Webster]

I would not care a pin, if the other three were in.
--Shak.
[1913 Webster]

Master, carest thou not that we perish? --Mark. iv.
38.
[1913 Webster]

{To care for}.
(a) To have under watchful attention; to take care of.
(b) To have regard or affection for; to like or love.
[1913 Webster]

He cared not for the affection of the house.
--Tennyson.
[1913 Webster]


请选择你想看的字典辞典：
单词字典翻译
Cared查看　Cared　在百度字典中的解释百度英翻中〔查看〕
Cared查看　Cared　在Google字典中的解释Google英翻中〔查看〕
Cared查看　Cared　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • List of algorithms - Wikipedia
    List of algorithms An algorithm is a fundamental set of rules or defined procedures that are typically designed and used to be a simpler way to solve a specific problem or a broad set of problems
  • Algorithm - Wikipedia
    Flowchart of an algorithm to find the greatest common divisor of two numbers In mathematics and computer science, an algorithm ( ˈælɡərɪðəm ⓘ) is a finite sequence [1] of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation [2] Algorithms are used as specifications for performing calculations and data processing
  • Sorting algorithm - Wikipedia
    Sorting algorithm Merge sort In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order The most frequently used orders are numerical order and lexicographical order, and either ascending order or descending order
  • Greedy algorithm - Wikipedia
    In this sense, a greedy algorithm is a special case of a dynamic programming algorithm Uriel Feige [1] notes that: [Greedy algorithms] may be viewed as the ultimate form of dynamic programming, in which only one partial solution is maintained The problem needs to have much more structure for this approach to work
  • Merge sort - Wikipedia
    The algorithm takes little more average time than standard merge sort algorithms, free to exploit O(n) temporary extra memory cells, by less than a factor of two Though the algorithm is much faster in a practical way, it is unstable for some lists But using similar concepts, they have been able to solve this problem
  • Maze-solving algorithm - Wikipedia
    A maze-solving algorithm is an automated method for solving a maze The random mouse, wall follower, Pledge, and Trémaux's algorithms are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas the dead-end filling and shortest path algorithms are designed to be used by a person or computer program that can see the whole maze at once Mazes containing no





中文字典-英文字典  2005-2009