Divide and Conquer Algorithms for Multi-dimensional Problems
Language: English
Published by Independently published, 2020
- Softcover
- New

Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
AbeBooks seller since April 6, 2009
Condition: New
US$ 11.35
Quantity: Over 20 available
Add to basketSeller Inventory # 41523357-n
- Title
- Divide and Conquer Algorithms for Multi-dimensional Problems
- Author
- Qochuk, Benjamin
- Publisher
- Independently published
- Publication year
- 2020
- Condition
- New
- Binding
- Soft cover
- Language
- English
- ISBN 13
- 9798653992537
- Series
- Book 2 of 2: Advanced Data Structures & Algorithms
This is a must read if you want to dive deeper into understanding Algorithms and its advanced applications.
Multidimensional divide and conquer is an algorithmic technique that can be used to develop several algorithms and data structures for multi-dimensional problems. It is an extension of Divide and Conquer algorithms.
The basic idea of Divide and Conquer is to divide the problem into smaller problems, solve the smaller problems and use the answers from the smaller problems to get the answer to the larger problem.
Merge Sort is a popular algorithm that applies Divide and Conquer to sort 1-dimensional data.
Extending such algorithms for Multi-dimensional data is not simple but it is an interesting approach that which nurture your thinking process and is more widely used as it reflects real-life problems.
This is important as most real-life problems are multi-dimensional like:
o A map of Earth is a 2-dimensional data
o Text is a multi-dimensional data for Clustering problems
o Augmented reality is usually 3-dimensional data
o Game graphics are at-least 3-dimensional data
o Physics consider our Universe to be 11-dimensional data
We use this paradigm to give best-known solutions to problems such as:
o Empirical Cumulative Distribution Functions problem (ECDF)
o Maxima problemo Range searching problem
o Closest pair problem
o All nearest neighbor problems
For all problems, we have demonstrated 1-dimension problem, 2-dimension problem, 3-dimension problem, k-dimension problem (all with time complexity analysis) and real-life applications.
We, also, presented open question in this domain which you can think about and potentially, develop a solution.
Read this book now and change the way you think about algorithms. This is a must read for everyone who wants to truely understand Algorithms and apply it to solve advanced problems.
"Synopsis" may belong to another edition of this title.
GreatBookPrices
Columbia, MD, U.S.A.
AbeBooks seller since April 6, 2009
Shipping rates within U.S.A.
| Item | 5 to 14 business days | 8 to 14 business days |
|---|---|---|
| First item | US$ 2.64 | US$ 2.64 |
Payment methods
Store description
SuperBookDeals.com is your top source for finding new books at the absolute lowest prices, guaranteed ! We offer big discounts - everyday - on millions of titles in virtually any category, from Architecture to Zoology -- and everything in between. Discover great deals and super-savings, on professional books, text book titles, the newest computer guides, or your favorite fiction authors. You'll find it all - at HUGE SAVINGS - at SuperBookDeals. Browse through our complete online product catalog today. Serving customers around the world for years, we help thousands find just the books they're looking for -- at incredibly low, bargain prices.…
Seller's business information
Expert Trading Limited
9220 Rumsey Road, Suite 101
Columbia, MD U.S.A. 21045
Terms of sale
Company Name: GreatBookPrices
Legal Entity: Expert Trading, LLC
Address: 9220 Rumsey Road, Ste 101, Columbia MD 21046
Email address: CustomerService@SuperBookDeals.com
Phone number: 410-964-0026
consumer complaints can be addressed to address above
Registration #: 52-1713923
Authorized representative: Danielle Hainsey
Shipping terms
Internal processing of your order will take about 1-2 business days. Please allow an additional 4-14 business days for Media Mail delivery. We have multiple ship-from locations - MD,IL,NJ,UK,IN,NV,TN & GA