Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.programmer > #31214
| Path | csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!newsfeed.fsmpi.rwth-aachen.de!newsfeed.straub-nv.de!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail |
|---|---|
| From | Ramine <ramine@1.1> |
| Newsgroups | comp.lang.java.programmer |
| Subject | Complexity and divide-and-conquer methods |
| Date | Wed, 25 Feb 2015 13:12:53 -0800 |
| Organization | A noiseless patient Spider |
| Lines | 28 |
| Message-ID | <mcl395$nus$9@dont-email.me> (permalink) |
| Mime-Version | 1.0 |
| Content-Type | text/plain; charset=utf-8; format=flowed |
| Content-Transfer-Encoding | 7bit |
| Injection-Date | Wed, 25 Feb 2015 18:11:49 +0000 (UTC) |
| Injection-Info | mx02.eternal-september.org; posting-host="d6dfe40a1c4bf4f2f24d15fd0d206698"; logging-data="24540"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18xTeJB2aK9y2xx5e4w489W" |
| User-Agent | Mozilla/5.0 (Windows NT 6.0; WOW64; rv:31.0) Gecko/20100101 Thunderbird/31.5.0 |
| Cancel-Lock | sha1:cXg2QXr9B6PNRoppGF3E84urmAs= |
| Xref | csiph.com comp.lang.java.programmer:31214 |
Show key headers only | View raw
Hello... I have come to an interesting subject.. I was asking myself right now what is exactly is the big and important improvement that brings Object oriented programming like C++ or Object Pascal or Java or C# ? I have thought rapidly at this and i think the BIG improvement that brings object oriented programming is that it tries to "minimize" at best "complexity" so that it can improve the criterion of "maintainability" etc.. but how can we look at object programming ? i think that by analogy it look like divide-and-conquer methods and algorithms, i mean that object oriented programming is like an "optimization" that minimizes at best the "complexity", divide-and-conquer methods and algorithms also try to minimize at best the number of steps or instructions that an algorithm have to do and we can measure that as a time complexity expressing it by a O(). Thank you, Amine Moulay Ramdane.
Back to comp.lang.java.programmer | Previous | Next — Next in thread | Find similar | Unroll thread
Complexity and divide-and-conquer methods Ramine <ramine@1.1> - 2015-02-25 13:12 -0800 Re: Complexity and divide-and-conquer methods Silvio <silvio@internet.com> - 2015-02-26 14:32 +0100 Re: Complexity and divide-and-conquer methods Kevin McMurtrie <mcmurtrie@pixelmemory.us> - 2015-02-26 19:28 -0800
csiph-web