Open in app

Sign In

Write

Sign In

Onur Uzun
Onur Uzun

152 Followers

Home

About

Jan 21, 2021

kth smalles/largest element

Using Min Heap — We can easily solve this problem in O(nlogk) by using a min-heap. The idea is to construct a min-heap of size k and insert first k elements of array (A[0..k-1]) into the heap. Then for each of the remaining elements of the array (A[k..n-1]), if that element is more than…

2 min read

2 min read


May 8, 2020

Struct vs Union

A structure is a user-defined data type available in C that allows to combining data items of different kinds. A union is a special data type available in C that allows storing different data types in the same memory location. You can define a union with many members, but only one member can contain a value at any given time. Unions provide an efficient way of using the same memory location for multiple purposes.

Programming

1 min read

Struct vs Union
Struct vs Union
Programming

1 min read


Dec 10, 2019

Microservices

Monolithic Applications Too complex One major problem is that the application is overwhelmingly complex. It’s simply too large for any single developer to fully understand. As a result, fixing bugs and implementing new features correctly becomes difficult and time consuming. Longer start-up time The sheer size of the application will also slow…

Microservices

4 min read

Microservices

4 min read


Aug 1, 2019

Data Compression

LZ77 and LZ78 LZ = Lempel Ziv Replaces repeated occurrences of data with references. Huffman Coding The algorithm is based on the frequency of occurrence of the data item(byte). The most frequent data items will represented and encoded with a lower number of bits. The main idea of the algorithm is create a binary tree, called Huffman tree, based on the bytes frequency on the data, where the leafs are the bytes symbols, and the path from the root to a leaf determines the new representation of that leaf byte.

Programming

1 min read

Data Compression
Data Compression
Programming

1 min read


Jul 8, 2019

Binary Trees

A binary tree is made of nodes, where each node contains a “left” reference, a “right” reference, and a data element. The topmost node in the tree is called the root. Advantages of trees Trees are so useful and frequently used, because they have some very serious advantages: Trees reflect structural relationships in…

Programming

4 min read

Programming

4 min read


Aug 30, 2018

Scam emails I’ve received during apartment search in Germany

If you search a flat in Germany, you will receive tons of scam emails. This one is the first and last(so far) scam mail I actually replied. Good evening, Thank you for your request in regard to my place (38m², 3rd floor, no elevator!) from Occamstraße 17, Schwabing-Freimann 80802, Munich. The…

Real Estate

9 min read

Real Estate

9 min read


Jul 10, 2018

Lambdas

What is a lambda expression in C++11? One of the best explanation of lambda expression is given from author of C++ Bjarne Stroustrup in his book ***The C++…stackoverflow.com The difference between a captured argument and a passing argument could be seen with an analogy. Consider the following function object: struct Capture { int &i; int const j; public: Capture(int &_i, int &_j) : i(_i), j(_j) {} int operator()(int const a, int const b) {…

Cplusplus

1 min read

Cplusplus

1 min read


Jul 10, 2018

MQTT and Mosquitto

MQTT is a machine-to-machine (M2M)/”Internet of Things” connectivity protocol. Eclipse Mosquitto is an open source message broker that implements the MQTT protocol. MQTT Mosquitto broker with SSL/TLS transport security Mosquitto configuration: To configure the Mosquito broker we need first to copy the certificates and key files to a known directory. …

Mqtt

2 min read

Mqtt

2 min read


Jun 7, 2018

Algorithms

LMNs- Algorithms - GeeksforGeeks Analyze an algorithm 1) Worst Case Analysis (Usually Done):In the worst case analysis, we calculate upper bound on…www.geeksforgeeks.org https://www.geeksforgeeks.org/commonly-asked-data-structure-interview-questions-set-1/ Binary Search Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to…

Programming

5 min read

Algorithms
Algorithms
Programming

5 min read


Apr 24, 2018

Virtual inheritance to solve diamond problem

You want: (Achievable with virtual inheritance) A / \ B C \ / D And not: (What happens without virtual inheritance) A A | | B C \ / D Virtual inheritance means that there will be only 1 instance of the base A class not 2. Your type D…

Programming

1 min read

Programming

1 min read

Onur Uzun

Onur Uzun

152 Followers
Following
  • 500px

    500px

  • Baki Hayat

    Baki Hayat

  • Kadir Malak

    Kadir Malak

  • Orhan Sönmez

    Orhan Sönmez

  • Martina Solés

    Martina Solés

See all (72)

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Text to speech

Teams