Monthly Archives: January 2020

[Unix] The fastest way to log into another machine using ssh

Posted on January 31, 2020 by codesmuggler | Programming Help | Coding assignment help

Writing passwords every time you log into another Unix machine using ssh disturbs you? It could be much simpler: [co[email protected]:~]$ ssh another-machine Linux 2.6.32.11. Things will be bright in P.M. A cop will shine a light in your face. [email protected]:~$ … Continue reading →

Posted in operating systems, snippets, unix | Tagged , , , , | Leave a comment

[C++] Radix sort – integers sorting

Posted on January 30, 2020 by codesmuggler | Programming Help | Coding assignment help

I have recently written article about counting sort, a linear complexity stable sorting algorithm: C++ counting sort implementation. Now I want to introduce you another fast sorting algorithm – radix sort. It is divided into two parts: one part that … Continue reading →

Posted in algorithms, c++, coding | Tagged , , , , , | 1 Comment

[Java] Ehcache – cache engine

Posted on January 28, 2020 by codesmuggler | Programming Help | Coding assignment help

In modern web applications scalability could be one of things that you have to take under consideration when you plan architecture and use of tools in your project. If you know that your application will be used by hundreds or … Continue reading →

Posted in coding, enterprise edition, java | Tagged , , , , , , , , , , , | Leave a comment

[Java] Full-text search with Lucene

Posted on January 22, 2020 by codesmuggler | Programming Help | Coding assignment help

Sometimes you have to search large text data in your database. When you use like “%text to find%” SQL expressions database does very slow searches. You can improve it by creating full-text indexes on database’s columns. It may be very … Continue reading →

Posted in coding, enterprise edition, java | Tagged , , , , , , , , | Leave a comment

[C++] Counting sort: faster than quicksort!

Posted on January 15, 2020 by codesmuggler | Programming Help | Coding assignment help

Probably you know sorting at good level, written quicksort and other fast algorithms thousand times. The best sorting algorithms which as main operation has comparing one value to another has O(nlogn) complexity. With the assumption of comparing values they couldn’t … Continue reading →

Posted in algorithms, c++, coding | Tagged , , , , | 1 Comment