Found 517 Articles for Swift

Selection sort algorithm in swift is a sorting algorithm, in which it select smallest or largest element from the given unsorted array and place that element at the beginning of the unsorted array. This process continue till the last unsorted element. So now we sort an array in descending order using selection sort. For example − Array: [6, 10, 3, 7] 1st iteration − For the first position iterate through whole array starting from in 0 to 3. After traversing through whole array we find 10 is the greatest number so swap 6 with 10. Resultant Array: ... Read More

Bubble sort algorithm in swift, is the easiest search algorithm. This algorithm sorts the elements by repeatedly swapping adjacent elements if they are not present at the right place. So now we sort an array in descending order using bubble sort. For example − Array - [4, 7, 1, 8] 1st iteration − compare two elements, if the first element is smaller than second element then swap their position. If not, then move to next pair. [4, 7, 1, 8] 41, remain same [7, 4, 1, 8] 14, remain same [7, 4, 8, 1] 41, remain same ... Read More

Selection sort algorithm in swift is a sorting algorithm, in which it select smallest or largest element from the given unsorted array and place that element at the beginning of the unsorted array. This process continue till the last unsorted element. So now we sort an array in ascending order using selection sort. For example − Array: [6, 10, 3, 7] 1st iteration − For the first position iterate through whole array starting from in 0 to 3. After traversing through whole array we find 3 is the smallest number so for the 1st position swap 6 with ... Read More

Quick sort algorithm in swift is a sorting algorithm which works on divide and conquer approach. In this sort, we first divide the array into subarrays by selecting a pivot element. Here the division takes place in such a way, in which the smallest elements placed at the left side of the pivot element and the largest element placed at the right side of the pivot element. Now the right and left subarrays are also divide using the same approach. This process continue till all the subarrays contain one element. At this point the array element are sorted now we ... Read More

In swift, Bubble sort algorithm is the easiest search algorithm. This algorithm sorts the elements by repeatedly swapping adjacent elements if they are not present at the right place. So now we sort an array in ascending order using bubble sort. For example − Array - [4, 7, 1, 8] 1st iteration − compare two elements, if the first element is greater than second element then swap their position. If not, then move to next pair. [4, 7, 1, 8] 41, swap the position [4, 1, 7, 8] 71, swap the position [1, 4, 7, 8] 4

Swift provide an in built function named as shuffle() to shuffle the elements of an array. This function takes a sequence or array and then shuffle the places of the elements present in the given array. Syntax func shuffle() Where this function does not take any parameter. Also it does not return any value instead it shuffle the places of the element in the given collection or array. Example In the following swift example, we will create and initialise an array of string type, then we shuffle the elements of the array using shuffle() function and display output. import ... Read More

In Swift, super keyword in used to access or call the methods, properties, and initialisers of the superclass from the base class. Or we can say that super keyword add more functionality to the superclass by adding its own unique behaviour. You can use super keyword with class properties, methods, and initialisers. Example In the following swift example, we will create a superclass or base class named as Books with bookName property, init() initialiser and display() method. Then we create a subclass named as Author, it is inherits from Author class along with override initi() initialiser and display() method. In ... Read More

In Swift, static keyword is used to define or create type-level properties and method that only belongs to the class itself rather than to its instances. Or we can say that we can directly access the static properties and methods of a class with help of class itself instead of creating the instance of the class. Algorithm Step 1 − Create a class. Step 2 − Inside the class define static property using static keyword and a instance property. Step 3 − Also define a static method using and static keyword and a instance method. Step 4 − Outside ... Read More

In Swift, to search elements in a set we can use either contains(_:) function or linear search. Both the methods efficiently search an element in a set. Lets discuss both the methods in detail along with examples. Method 1: Using contains(_:) Function Swift provide an inbuilt function named as contains() function to search an element in a set. This function return true if the specified element is present in the given set. This function will return false if the specified element is present in the given set. Syntax sets.contains(myElement) Where sets is a finite set and myElement represent the ... Read More

In Swift, we create a user defined function to rotate the elements of an array. In this function, first we find the total number of rotation and then rotate the array by the specified number of rotation. For example − Array = [3, 5, 2, 1, 7, 9] Rotation = 2 Resultant Array = [2, 1, 7, 9, 3, 5] Algorithm Step 1 − Create a function that rotate the elements of the array in the specified number of rotation. Step 2 − Inside the function first we find the required number of rotations. Step 3 − Then ... Read More