On May 31, 2017, at 12:33 AM, jay pokarna wrote:
>
>Could you tell the way as to how can I measure the time taken
> by my algorithm and compare it with the inbuilt functions ?
No, that's beyond our charter. We review patches for gcc. I'd recommend
google, it has answers to most questi
Hey,
Could you tell the way as to how can I measure the time taken
by my algorithm and compare it with the inbuilt functions ?
My algorithm is similar to std::binary_search in working.
Also , could you recommend some data that could be helpful to help the
comparison between the function an
On May 29, 2017, at 1:05 AM, jay pokarna wrote:
>
> Could you give me the contact of the standard committee?
https://isocpp.org/std/the-committee
Respected Sir,
Could you give me the contact of the standard
committee which handles changes to the c++ standard.
Regards,
Jay Pokarna
On Mon, May 29, 2017 at 2:17 PM, Tim Shen wrote:
> On Mon, May 29, 2017 at 1:05 AM, jay pokarna wrote:
The technique that I have u
Respected Sir,
I am sorry , for the use of wrong language
in the previous mail. I wanted to convey that c++ has generalised the
algorithm on various data structures , which is not required due to
low performance.
Could you give me the contact of the standard committee?
R
This is not a patch. Nor is it an implementation of
std::binary_search, which is a function template that accepts
arbitrary forward iterators and optionally arbitrary comparator
objects, rather than just pointers.
If you want to find someone to review your code, consider something
like https://cod
Hey,
I am Jay.
I have written code for an optimised version of the binary_search
algorithm of the algorithm header file of the standard template
library.
I have implemented it for the integer data type, but it can be
implemented for any other data type without any changes in the
algorithm as suc
