Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.java.programmer > #31214

Complexity and divide-and-conquer methods

Show all headers | 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

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