Comments on: const Correctness: Difference between Foo* const ptr, const Foo* ptr, const Foo* const ptr http://tekpool.wordpress.com/2007/01/10/const-correctness-difference-between-foo-const-ptr-const-foo-ptr-const-foo-const-ptr/ The largest pool of technical questions with answers, explantions, code and detailed analysis Tue, 17 Nov 2009 16:28:09 +0000 http://wordpress.com/ hourly 1 By: Marinkina http://tekpool.wordpress.com/2007/01/10/const-correctness-difference-between-foo-const-ptr-const-foo-ptr-const-foo-const-ptr/#comment-9603 Marinkina Thu, 21 May 2009 23:17:06 +0000 http://tekpool.wordpress.com/2007/01/10/const-correctness-difference-between-foo-const-ptr-const-foo-ptr-const-foo-const-ptr/#comment-9603 Пора переименовать блог, присвоив название связанное с доменами :) может хватит про них? Пора переименовать блог, присвоив название связанное с доменами :) может хватит про них?

]]> By: Sharad Upadhyay http://tekpool.wordpress.com/2007/01/10/const-correctness-difference-between-foo-const-ptr-const-foo-ptr-const-foo-const-ptr/#comment-322 Sharad Upadhyay Fri, 02 Feb 2007 06:52:23 +0000 http://tekpool.wordpress.com/2007/01/10/const-correctness-difference-between-foo-const-ptr-const-foo-ptr-const-foo-const-ptr/#comment-322 Hi Andreas, Can you please post your comment of O(1) space merge of two sorted arrays? It would be good to know how it works. It is needed for O(NlogN) time and O(1) space merge sort algorithm. Most of the books talk about extra O(N) space solution, please let me know which book explain O(1) space merge sort. Hi Andreas,

Can you please post your comment of O(1) space merge of two sorted arrays? It would be good to know how it works. It is needed for O(NlogN) time and O(1) space merge sort algorithm. Most of the books talk about extra O(N) space solution, please let me know which book explain O(1) space merge sort.

]]>