Zafer Şevik·Feb 8, 2018How to integrate external frameworks to an iOS project using Carthage?What is Carthage?
Zafer Şevik·Oct 5, 2017How to implement Binary Search in Swift?Binary Search is an efficient algorithm used to find an item from an ordered list. You can implement Binary Search algorithm recursively by…
Zafer Şevik·Sep 18, 2017How to implement Selection Sort in Swift?Selection Sort is a sorting algorithm with O(n²) time complexity. Selection Sort is an algorithm simple to understand and inefficient (time…
Zafer Şevik·Sep 11, 2017How do you implement Quick Sort in Swift?Quick Sort (also called Partition-Exchange Sort) is an efficient divide and conquer algorithm developed by Tony Hoare in 1959. In worst…A response icon1A response icon1
Zafer Şevik·Sep 6, 2017Insertion Sort in SwiftInsertion Sort is a simple sorting algorithm runs in О(n²) time. It is less efficient than Quick Sort, Merge Sort or Heap Sort on larger…
Zafer Şevik·Aug 24, 2017Merge Sort in SwiftMerge sort is a divide and conquer algorithm that runs in O(n log n) time and was invented in 1945 by John von Neumann.
Zafer Şevik·Jun 12, 2017String Rotation in SwiftQ 1.9 Assume you have a method isSubstring which checks if one word is a substring of another. Given two strings, s1 and s2, write code to…
Zafer Şevik·Jun 11, 2017Zero Matrix in SwiftQ 1.8 Write an algorithm such that if an element in an MxN matrix is zero, it’s entire row and column are set to zero.