Serializing Data – domain model to persistence

http://nshipster.com/nscoding/ There are many ways you serialize data, or convert domain model to persistence: Core Data NSKeyedArchiver pList NSUserDefault etc… Core Data may not be your answer because: Not all apps need to query data. Not all apps need automatic migrations. Not all apps work with large or complex object graphs. NSKeyArchiver and NSCoding Thus, […]

ARC vs MRC

https://www.quora.com/How-does-garbage-collection-happen-in-iOS http://stackoverflow.com/questions/6385285/why-doesnt-ios-have-automatic-garbage-collection Manual Reference Counting has the developer take care of the allocation and release of the object life cycle by using new/delete, alloc/release. You have to make sure every alloc is matched with a release. MRC behind the wheel : 1. Every time you create and allocate an object, you increase the reference count […]

Height of Tree

Height of tree is used to find the maximum number of steps to search for an item in a data set using logarithmic division. If you wanted to find a number in that tree, you compare the toFind integer with the current node. If larger, go down right side. If smaller, go down left side. […]

QuickSort

http://www.algolist.net/Algorithms/Sorting/Quicksort

Sort in Place

In-place sorting is a form of sorting in which a small amount of extra space is used to manipulate the input set. In other words, the output is placed in the correct position while the algorithm is still executing, which means that the input will be overwritten by the desired output on run-time.

stable sorting

http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms A sorting algorithm is said to be stable if two objects with equal keys appear in the same order in sorted output as they appear in the input array to be sorted. Suppose we have input: peach straw apple spork Sorted would be: apple peach straw spork and this would be stable because even […]

hash table

xCode 7.3 demo Hash Table First, let’s define the hash entry. It is simply a key and a value. It means that given a key, this key will map to this value.

First, we define an array of HashEntry pointers.

table must be a double pointer, because the initial pointer points to the […]

Deleting in Azure

Given that a refresh pull involves pulling data that is filtered according to an attribute, Soft Delete involves setting that attribute to YES/NO. This affects clients in that they will then not be able to pull that data. Additionally, that data is kept safe in Easy Table for future references and undeletes. For example, let’s […]