AI & ChatGPT searches , social queriess for DIVIDE AND-CONQUER-ALGORITHM
Search references for DIVIDE AND-CONQUER-ALGORITHM. Phrases containing DIVIDE AND-CONQUER-ALGORITHM
See searches and references containing DIVIDE AND-CONQUER-ALGORITHM!
Search references for DIVIDE AND-CONQUER-ALGORITHM. Phrases containing DIVIDE AND-CONQUER-ALGORITHM
See searches and references containing DIVIDE AND-CONQUER-ALGORITHM!DIVIDE AND-CONQUER-ALGORITHM
Algorithms which recursively solve subproblems
In computer science, divide and conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more
Divide-and-conquer_algorithm
Algorithm to multiply matrices
than the cache misses. An alternative to the iterative algorithm is the divide-and-conquer algorithm for matrix multiplication. This relies on the block
Matrix multiplication algorithm
Matrix_multiplication_algorithm
I/O-efficient algorithm regardless of cache size
cache-oblivious algorithms is to reduce the amount of such tuning that is required. Typically, a cache-oblivious algorithm works by a recursive divide-and-conquer algorithm
Cache-oblivious_algorithm
Algorithm on Hermitian matrices
Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s)
Divide-and-conquer eigenvalue algorithm
Divide-and-conquer_eigenvalue_algorithm
Topics referred to by the same term
Look up divide and rule or divide and conquer in Wiktionary, the free dictionary. Divide and conquer or divide and rule (Latin: divide et impera) is a
Divide and conquer (disambiguation)
Divide_and_conquer_(disambiguation)
Triangulation method
incremental algorithm based on rip-and-tent, which is practical and highly parallelized with polylogarithmic span. A divide and conquer algorithm for triangulations
Delaunay_triangulation
Tool for analyzing divide-and-conquer algorithms
In the analysis of algorithms, the master theorem for divide-and-conquer recurrences provides an asymptotic analysis for many recurrence relations that
Master theorem (analysis of algorithms)
Master_theorem_(analysis_of_algorithms)
Sequence of operations for a task
the shortest path between two points and cracking passwords. Divide and conquer A divide-and-conquer algorithm repeatedly reduces a problem to one or
Algorithm
Divide and conquer sorting algorithm
the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of
Merge_sort
Divide-and-conquer algorithm to compute a Hadamard transform
{\displaystyle n\log n} additions or subtractions. The FWHTh is a divide-and-conquer algorithm that recursively breaks down a WHT of size n {\displaystyle n}
Fast_Walsh–Hadamard_transform
Polygonal region of all points visible from a given point in a plane
segments. A divide-and-conquer algorithm to compute the visibility polygon was proposed in 1987. An angular sweep, i.e. rotational plane sweep algorithm to compute
Visibility_polygon
Algorithm for integer multiplication
algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a divide-and-conquer
Karatsuba_algorithm
Software engineering
minimizing the effort to find a specific change set. It employs a divide and conquer algorithm that depends on having access to the code history which is usually
Bisection (software engineering)
Bisection_(software_engineering)
Method of searching a sorted array
search technique is a method of searching a sorted array using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci
Fibonacci_search_technique
Algorithmic technique
the sequence into two halves, summing each half, and adding the two sums: a divide and conquer algorithm. Its worst-case roundoff errors grow asymptotically
Pairwise_summation
Algorithm that arranges lists in order
of algorithms for the problem provides a gentle introduction to a variety of core algorithm concepts, such as big O notation, divide-and-conquer algorithms
Sorting_algorithm
Divide and conquer sorting algorithm
than merge sort and heapsort for randomized data, particularly on larger distributions. Quicksort is a divide-and-conquer algorithm. It works by selecting
Quicksort
Computer program for the Boolean satisfiability problem
whereas divide-and-conquer algorithms divide the problem between the processors. Different approaches exist to parallelize local search algorithms. The International
SAT_solver
Mathematical problem set on a chessboard
knight's tour on a given board with a computer. Some of these methods are algorithms, while others are heuristics. A brute-force search for a knight's tour
Knight's_tour
Any planar graph can be subdivided by removing a few vertices
efficient divide and conquer algorithms for planar graphs, and dynamic programming on these hierarchies can be used to devise exponential time and fixed-parameter
Planar_separator_theorem
Class of algorithms in computational geometry
case. Divide and conquer, a.k.a. merge hull — O(n log n) Another O(n log n) algorithm, published in 1977 by Preparata and Hong. This algorithm is also
Convex_hull_algorithms
Computer graphics algorithm
rendered; otherwise it is divided into smaller parts which are likewise tested for simplicity. This is a divide and conquer algorithm with run-time of O (
Warnock_algorithm
Problem in computer science
time either by using Kadane's algorithm as a subroutine, or through a divide-and-conquer approach. Slightly faster algorithms based on distance matrix multiplication
Maximum_subarray_problem
Fast Fourier Transform algorithm
general technique of divide and conquer algorithms; in many conventional implementations, however, the explicit recursion is avoided, and instead one traverses
Cooley–Tukey_FFT_algorithm
Computational geometry problem
and this is optimal for this model, by a reduction from the element uniqueness problem. Both sweep line algorithms and divide-and-conquer algorithms with
Closest pair of points problem
Closest_pair_of_points_problem
Discrete Fourier transform algorithm
far the most commonly used FFT is the Cooley–Tukey algorithm. This is a divide-and-conquer algorithm that recursively breaks down a DFT of any composite
Fast_Fourier_transform
Algorithm to multiply two numbers
known. Karatsuba multiplication is an O(nlog23) ≈ O(n1.585) divide and conquer algorithm, that uses recursion to merge subcalculations. By rewriting the
Multiplication_algorithm
dynamic programming and divide-and-conquer. Techniques for designing and implementing algorithm designs are also called algorithm design patterns, such
Glossary_of_computer_science
Numerical eigenvalue calculation
O(m^{2})} operations, and evaluating it at a point in O ( m ) {\displaystyle O(m)} operations. The divide-and-conquer eigenvalue algorithm can be used to compute
Lanczos_algorithm
Sorting algorithm
sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting algorithms partitions
Samplesort
Type of search algorithm
they are more than two) at each step. It is a specific type of divide and conquer algorithm. A well-known example is binary search. Abstractly, a dichotomic
Dichotomic_search
American computer scientist (born 1953)
Efficient Programs, Prentice-Hall, 1982, ISBN 0-13-970244-X. Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Space, Ph.D.
Jon Bentley (computer scientist)
Jon_Bentley_(computer_scientist)
Overview of and topical guide to algorithms
solving many divide-and-conquer recurrences Brute-force search — method of exhaustively checking candidate solutions Divide-and-conquer algorithm — technique
Outline_of_algorithms
Recursive algorithm for matrix multiplication
algorithm, a faster generalization of the Karatsuba algorithm that permits recursive divide-and-conquer decomposition into more than 2 blocks at a time Strassen
Strassen_algorithm
Algorithmic technique
parallelization and checkpointing. In a less specific sense, binary splitting may also refer to any divide and conquer algorithm that always divides the problem
Binary_splitting
Concept in computational geometry
approach to finding a MDS is divide-and-conquer. A typical algorithm in this approach looks like the following: Divide the given set of shapes into two
Maximum_disjoint_set
Method in computer science
divide and conquer algorithms where the sub-problems have substantially different sizes. It is a generalization of the master theorem for divide-and-conquer
Akra–Bazzi_method
lies in finding the zeros of secular functions. A divide-and-conquer algorithm to find the eigenvalues and eigenvectors for various kinds of matrices is well
Simple_rational_approximation
paradigms of divide and conquer algorithms, greedy algorithms, and randomized algorithms to achieve expected linear performance. Deterministic algorithms that
Expected linear time MST algorithm
Expected_linear_time_MST_algorithm
Topics referred to by the same term
cervix to remove uterine contents Divide and conquer algorithm, a strategy for dynamic programming Doctrine and Covenants, part of the scripture of the
D&C
Davenport–Schinzel sequences, and these envelopes can be computed efficiently by a divide-and-conquer algorithm that computes and then merges the envelopes
Lower_envelope
Numerical methods for matrix eigenvalue calculation
(May 2013), "A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices.", Applied and Computational Harmonic
Eigenvalue_algorithm
cache friendly binary search algorithm Fibonacci search technique: search a sorted sequence using a divide and conquer algorithm that narrows down possible
List_of_algorithms
Divide-and-conquer algorithm for generating a random permutation of a finite set
shuffle is a divide-and-conquer algorithm for shuffling a finite sequence. The algorithm takes a list of all the elements of the sequence, and for each element
Rao–Sandelius_shuffle
Selection algorithm
Communications of the ACM, volume 18, issue 3. The Floyd–Rivest algorithm is a divide-and-conquer algorithm, sharing many similarities with quickselect. It uses
Floyd–Rivest_algorithm
Type of function in database management
desirable to divide such computations into smaller pieces, and distribute the work, usually computing in parallel, via a divide and conquer algorithm. Some aggregate
Aggregate_function
Data structure
the endurance of database systems. Binary search tree B-tree Divide-and-conquer algorithm See note after 3rd paragraph. Elmasri, Ramez; Navathe, Shamkant
B+_tree
Probability distribution
stable, and should be avoided if n {\displaystyle n} is greater than approximately 20. An alternative is to use a divide-and-conquer algorithm: if we assume
Poisson_binomial_distribution
Matrix with a multiplicative inverse
upper block A. Those formulas together allow to construct a divide and conquer algorithm that uses blockwise inversion of associated symmetric matrices
Invertible_matrix
Sorting algorithm
list-sorting algorithm in CPython and is also used in NumPy, PyPy, AssemblyScript, and Apple's WebKit. Powersort belongs to the family of merge sort algorithms. More
Powersort
evolutionary algorithms, e.g. genetic algorithms. One simple optimization that is important on real maps is dividing a set of labels into smaller sets that
Automatic_label_placement
Type of computer science algorithm
O(log n) stack space pointers to keep track of the subarrays in its divide and conquer strategy. Consequently, quicksort needs O(log2 n) additional space
In-place_algorithm
Dividing a system in computer science
Composition Code refactoring Component-based software engineering Divide-and-conquer algorithm Duplicate code Dynamization Event partitioning Functional decomposition
Decomposition (computer science)
Decomposition_(computer_science)
Number expressed in the base-2 numeral system
is very large. A simple divide-and-conquer algorithm is more effective asymptotically: given a binary number, it is divided by 10k, where k is chosen
Binary_number
Property of a computational problem
subproblems as well, divide-and-conquer methods or dynamic programming may be used. If there are no appropriate greedy algorithms and the problem fails to
Optimal_substructure
Fast approximate median algorithm
time with poor pivot choices. This is because quickselect is a divide and conquer algorithm, with each step taking O ( n ) {\displaystyle O(n)} time in the
Median_of_medians
Processing mode
each cell, and then computing the aggregation for a roll-up of cells by aggregating these aggregates, applying a divide and conquer algorithm to the multidimensional
Online_analytical_processing
N-th root of the arithmetic mean of the given numbers raised to the power n
computations of equal sized sub-blocks. This enables use of a divide and conquer algorithm to calculate the means, when desirable. In general, if p < q
Generalized_mean
Oral puzzle guessing game
the puzzle above is: "Was the gun loaded?" Twenty Questions Divide and conquer algorithm Brain teaser Riddle Creative problem solving Edward De Bono,
Situation_puzzle
Mathematical puzzle game
Towers of Bucharest and Towers of Klagenfurt game configurations yield ternary and pentary Gray codes. The Frame–Stewart algorithm is described below:
Tower_of_Hanoi
Technique or strategy underlying a variety of algorithms
algorithm, just as an algorithm is an abstraction higher than a computer program. Backtracking Branch and bound Brute-force search Divide and conquer
Algorithmic_paradigm
Topics referred to by the same term
computability theory The master theorem (analysis of algorithms), about the complexity of divide-and-conquer algorithms This disambiguation page lists articles associated
Recursion_theorem
Topics referred to by the same term
include: Master theorem (analysis of algorithms), analyzing the asymptotic behavior of divide-and-conquer algorithms Ramanujan's master theorem, providing
Master_theorem
Subtraction game
22, 34, 39, 44, … (sequence A030193 in the OEIS) A faster divide and conquer algorithm can compute the same sequence of numbers, up to any threshold n
Subtract_a_square
Matrix with nonzero elements on the main diagonal and the diagonals above and below it
V. (2012). "A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices". Applied and Computational Harmonic
Tridiagonal_matrix
Sorting algorithm
some divide-and-conquer algorithms such as quicksort and mergesort outperform insertion sort for larger arrays, non-recursive sorting algorithms such
Insertion_sort
Theory of irregularities of distribution
Monte Carlo methods in high dimensions Computational geometry: Divide-and-conquer algorithm Image processing: Halftoning Random trial formulation: Randomized
Discrepancy_theory
Product of numbers from 1 to n
logarithm coming from the divide and conquer and another coming from the multiplication algorithm. In the recursive calls to the algorithm, the prime number theorem
Factorial
backtracking with beam search and can be combined with the divide and conquer algorithm technique, resulting in divide-and-conquer beam-stack search. Beam search
Beam_stack_search
Data structure
simple divide-and-conquer algorithms. It has since been augmented to maintain dynamically various properties of a tree such as diameter, center and median
Top_tree
Breaks a data stream into multiple lower data rate streams
multiple vehicles and reassembled at the destination. This is analogous to inverse multiplexing. Bonding protocol Divide-and-conquer algorithm Inverse Multiplexing
Inverse_multiplexer
Sorting algorithm
arrays by Θ ( n log n ) {\displaystyle \Theta (n\log n)} divide-and-conquer algorithms such as mergesort. However, insertion sort or selection sort
Selection_sort
classical algorithm design techniques including backtracking, divide-and-conquer algorithms, and dynamic programming, methods for the analysis of algorithms, and
Algorithmic_Puzzles
Overview of and topical guide to combinatorics
formula Parity, even and odd permutations Combinatorial Nullstellensatz Incidence algebra Greedy algorithm Divide and conquer algorithm Akra–Bazzi method
Outline_of_combinatorics
Chinese-born American chemist (born 1961)
used in chemistry and was the second most cited article in chemistry from 1999 to 2006. Yang developed the Divide and Conquer algorithm for linear-scaling
Weitao_Yang
Technique in functional programming
via pointer equality, which in turn can improve efficiency of divide and conquer algorithms when data sets contain overlapping blocks. Hash consing has
Hash_consing
Mathematical problem
and Godfried Toussaint (1981) proved that a placement for these guards may be computed in O(n log n) time in the worst case, via a divide and conquer
Art_gallery_problem
Russian mathematician (1937–2008)
to two editions, 1975 and 1983. The Karatsuba algorithm is the earliest known divide and conquer algorithm for multiplication and lives on as a special
Anatoly_Karatsuba
Topological index of a molecule
each subtree and multiplying the two sums. This divide and conquer algorithm can be generalized from trees to graphs of bounded treewidth, and leads to near-linear-time
Wiener_index
and their bisectors. The resulting graph has only a linear number of edges and can be constructed in O(n log n) using a divide and conquer algorithm or
Rectilinear minimum spanning tree
Rectilinear_minimum_spanning_tree
analysis, and prediction. Brute force is a simple, exhaustive technique that evaluates every possible outcome to find a solution. The divide and conquer technique
Algorithmic_technique
algorithm for solving the large-scale capacitated arc routing problem using a cooperative co-evolution algorithm. LSCARP can be solved with a divide and
Capacitated arc routing problem
Capacitated_arc_routing_problem
Method for finding kth smallest value
Kleinberg, Jon; Tardos, Éva (2006). "13.5 Randomized divide and conquer: median-finding and quicksort". Algorithm Design. Addison-Wesley. pp. 727–734. ISBN 9780321295354
Selection_algorithm
Chinese-American computer scientist
friends as CDQ. A well known algorithm in competitive programming, CDQ Divide and Conquer, is named after this acronym. She is married to Huacheng Yu, an assistant
Danqi_Chen
Algorithmic problem on point-line incidence
of solving the problem involves a geometric divide-and-conquer algorithm. For a given system of points and lines, it is possible to use the theory of epsilon-nets
Hopcroft's_problem
Exponent of a power of two
some divide and conquer algorithms, such as the Karatsuba algorithm for multiplying n-bit numbers in time O(nlog2 3), and the Strassen algorithm for multiplying
Binary_logarithm
a divide-and-conquer type. A node starts the computation and divides the problem in two (or more usually, a multiple of 2) roughly equal parts and distribute
Dijkstra–Scholten_algorithm
Algorithm that combines multiple sorted lists into one
demonstrates this algorithm in a parallel divide-and-conquer style (adapted from Cormen et al.). It operates on two sorted arrays A and B and writes the sorted
Merge_algorithm
Edges that hit all cycles in a graph
In graph theory and graph algorithms, a feedback arc set or feedback edge set in a directed graph is a subset of the edges of the graph that contains at
Feedback_arc_set
upper envelope of a set of static lines can be computed using a divide and conquer algorithm which partitions the lines into two sets of equal size, calls
Kinetic_convex_hull
Analysis and Applications. 9: 61–76. CiteSeerX 10.1.1.64.8032. doi:10.1137/0609005. hdl:10945/30445. Article title A Parallel Divide and Conquer Algorithm for
William_B._Gragg
implementations of recursive algorithms, particularly implementations of divide-and-conquer or decrease-and-conquer algorithms, where the size of the data
Hybrid_algorithm
American computer scientist and engineer
Petruccione, Francesco; da Silva, Adenilton J. (2021-03-18). "A divide-and-conquer algorithm for quantum state preparation". Scientific Reports. 11 (1): 6329
Igor_L._Markov
Partition of a graph whose components are reachable from all vertices
diameter of the graph is small); and (2) the independence between the subtasks in the divide-and-conquer process. This algorithm performs well on real-world
Strongly_connected_component
Stanley C. (1995). "A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem". SIAM Journal on Matrix Analysis and Applications. 16: 172–191
Arrowhead_matrix
Humorous sorting algorithm
the opposites of divide and conquer). It was published in 1984 by Andrei Broder and Jorge Stolfi in their paper "Pessimal Algorithms and Simplexity Analysis"
Slowsort
Use of functions that call themselves
examples include divide-and-conquer algorithms such as Quicksort, and functions such as the Ackermann function. All of these algorithms can be implemented
Recursion_(computer_science)
Sequence of program instructions invokable by other software
implementation of functionality defined by mathematical induction and recursive divide and conquer algorithms. Here is an example of a recursive function in C to find
Function (computer programming)
Function_(computer_programming)
Algorithms for polynomial evaluation
0 {\displaystyle R_{0}} and R 1 {\displaystyle R_{1}} on each half of the points. This gives us a divide-and-conquer algorithm with T ( n ) = 2 T ( n /
Polynomial_evaluation
Visibility in 3D computer graphics
graphics primitives can be computationally-expensive and is usually done by divide and conquer. The different hidden-surface determination techniques
Hidden-surface_determination
DIVIDE AND-CONQUER-ALGORITHM
DIVIDE AND-CONQUER-ALGORITHM
Girl/Female
Celtic
Divine one.
Surname or Lastname
English and German
English and German : topographic name from Old English land, Middle High German lant, ‘land’, ‘territory’. This had more specialized senses in the Middle Ages, being used to denote the countryside as opposed to a town or an estate.English : topographic name for someone who lived in a forest glade, Middle English, Old French la(u)nde, or a habitational name from Launde in Leicestershire or Laund in West Yorkshire, which are named with this word.Norwegian : habitational name from any of three farmsteads so named, from Old Norse land ‘land’, ‘territory’ (see 1 above).
Boy/Male
Australian, French, German, Hebrew, Italian, Portuguese, Swiss
Italian Form of David; Beloved; Dear One
Girl/Female
Indian
Divine
Surname or Lastname
English and German
English and German : nickname for someone with a deformed hand or who had lost one hand, from Middle English hand, Middle High German hant, found in such appellations as Liebhard mit der Hand (Augsburg 1383).Jewish (Ashkenazic) : nickname from German Hand ‘hand’ (see 1).Irish : Anglicized form of Gaelic Ó Flaithimh (see Guthrie), resulting from an erroneous association of the Gaelic name with the Gaelic word lámh ‘hand’. It is used as an English equivalent for several other names of Gaelic origin too, e.g. Claffey, Glavin, and McClave.Dutch : from a variant of hont ‘dog’, ‘hound’, either a derogatory nickname, or a habitational name for someone living at a house distinguished by the sign of a dog.
Male
Yiddish
Yiddish form of Hebrew David, DOVID means "beloved."
Girl/Female
Latin
Divine one.
Male
English
Variant spelling of English Connor, CONNER means "hound-lover."
Surname or Lastname
English, German, and Jewish (Ashkenazic)
English, German, and Jewish (Ashkenazic) : metonymic occupational name for a maker of hoops and bands, etc., from Middle English band, bond, Middle High German, Middle Low German bant, German Band denoting something used for tying or binding: ‘hoop’, ‘metal band’, ‘fetter’, ‘shackle’.Old spelling of the Dutch cognates Bant, Bande, from Middle Dutch bant ‘band’.
Girl/Female
Hindu, Indian, Sanskrit
Divine; The Heaven
Surname or Lastname
English
English : from Old French conquest ‘conquest’, probably applied as a nickname.
Surname or Lastname
English and Scottish
English and Scottish : variant of Davids.
Girl/Female
Hindu, Indian, Tamil
Divine Power; Lovely
Girl/Female
Indian
Divine power
Male
Italian
Italian form of Hebrew David, DAVIDE means "beloved."
Male
English
 English pet form of Hebrew David, DAVIE means "beloved." Compare with another form of Davie.
Girl/Female
Christian & English(British/American/Australian)
Feminie of David
Female
English
(דָוִידָה) Feminine form of Hebrew David, DAVIDA means "beloved."
Female
English
English name based on the vocabulary word divine, DIVINA means "goddess-like" or "from heaven."
Girl/Female
English
Beloved. Feminine of David.
DIVIDE AND-CONQUER-ALGORITHM
DIVIDE AND-CONQUER-ALGORITHM
Boy/Male
Hindu, Indian, Marathi
Strong Armed
Boy/Male
Czech
Gift from God.
Male
Hawaiian
Hawaiian name KEAHI means "flames."
Male
Icelandic
Icelandic form of Old Norse Hjortr, HJÖRTUR means "hart, stag."
Male
Hindi/Indian
Masculine variant form of Hindi unisex Swarna, SWARAN means "good color."Â
Girl/Female
Australian, Irish
Name of a Legendary Early Invader of Ireland; A Companion of the Woman Leader Cessair
Boy/Male
Native American
Sage.
Surname or Lastname
English
English : habitational name from places in Cambridge, Hereford, and Suffolk named from Old English Ä“g, a term denoting low-lying land, an island or promontory, or an area of dry land in a marsh.
Girl/Female
Indian
Soft
Girl/Female
Indian, Punjabi, Sikh
Palace
DIVIDE AND-CONQUER-ALGORITHM
DIVIDE AND-CONQUER-ALGORITHM
DIVIDE AND-CONQUER-ALGORITHM
DIVIDE AND-CONQUER-ALGORITHM
DIVIDE AND-CONQUER-ALGORITHM
v. t.
To divide anew.
imp. & p. p.
of Conquer
imp. & p. p.
of Divide
v. t.
To cause to be separate; to keep apart by a partition, or by an imaginary line or limit; as, a wall divides two houses; a stream divides the towns.
n.
A conjurer; a diviner.
v. t.
To render divine; to deify.
v. t.
To separate into two parts, in order to ascertain the votes for and against a measure; as, to divide a legislative house upon a question.
a.
Appropriated to God, or celebrating his praise; religious; pious; holy; as, divine service; divine songs; divine worship.
v. t.
To mark divisions on; to graduate; as, to divide a sextant.
a.
Of or belonging to God; as, divine perfections; the divine will.
v. t.
To subdue or overcome by mental or moral power; to surmount; as, to conquer difficulties, temptation, etc.
n.
One who conquers.
imp. & p. p.
of Divine
v. i.
To conjecture or guess; as, to divine rightly.
v. t.
To gain or obtain, overcoming obstacles in the way; to win; as, to conquer freedom; to conquer a peace.
v. t.
To conquer again; to recover by conquest; as, to reconquer a revolted province.
n.
One who, or that which, consumes; as, the consumer of food.
v. t.
To divide; to cleave in two.
a.
Proceeding from God; as, divine judgments.
n.
The conger eel; -- called also congeree.