Programming Articles - Page 380 of 3363

In Swift, there is the Date class to work with all kinds of date formats. You can manipulate and format date objects using the Date class. There are other supported classes like DateComponents, DateFormatter, etc that help you format date objects from one type to another type. Let's learn about dates with some examples. In Swift, you can create a Date object using the Date() initializer, which returns the current date and time − let currentDate = Date() Creating a Date Object From a String Representation You can create a Date object from a string representation of a date ... Read More

In Swift, you can use the "+" operator and join function to join the strings. You can concatenate multiple strings using this operator. In this article, we will see some examples of how to concatenate the strings. Here are several examples of using the operator and in-built functions. Algorithm Step 1 − Create the strings Step 2 − Combine both strings using the given function Step 3 − Print the input and output string on the console Example 1 In this example, we will see an example of adding two strings with a space. import Foundation let ... Read More

In Swift, you can use the DateFormatter class to convert a string date to a date object. This class provides date conversion properties and methods. In this article, we will see some examples of date conversions. DateFormatter Class Swift's standard library has a class that is used to convert dates. It may be used to change a string into a date object and the other way around. To parse date objects in various formats, this class offers attributes and methods. You must build an object of the DateFormatter class in order to transform a string to a date object and ... Read More

In Swift, a set is used to create an unordered collection of unique elements. To split a set into two halves we use a approach in which we first determine the midpoint of the given set using integer division method and then loop through the set and insert element into either the first half or second half set according to the index related to the midpoint. For example − Original Set - [2, 4, 5, 6, 7, 1] Set1 - [2, 4, 5] Set2 - [6, 7, 1] Algorithm Step 1 − Create a function which takes ... 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 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