# Segregate even and odd nodes in sorted order in swift

Swift program for Segregate even and odd nodes in sorted order. Here problem description and other solutions.

``````import Foundation
// Swift 4 program for
// Segregate even and odd nodes in ascending order

{
var data: Int;
init(_ data: Int)
{
self.data = data;
self.next = nil;
}
}
class SingleLL
{
init()
{
}
func insert(_ value: Int)
{
// Create a node
{
}
else
{
// Find last node
while (temp!.next  != nil)
{
// Visit to next node
temp = temp!.next;
}
// Add node at last position
temp!.next = node;
}
}
// Display all Linked List elements
func display()
{
{
while (temp  != nil)
{
// Display node value
print(" ",temp!.data, terminator: " ");
// Visit to next node
temp = temp!.next;
}
}
else
{
}
}
{
{
}
{
}
else
{
// Finding location of inserting node
while (temp!.next  != nil &&
temp!.next!.data < element!.data)
{
// Visit to next node
temp = temp!.next;
}
element!.next = temp!.next;
temp!.next = element;
}
}
func segregateNode(_ odd: SingleLL , _ even : SingleLL )
{
// Iterating the linked list node
{
// Visit to next node
// Set null to next node
node!.next = nil;
if (node!.data % 2 == 0)
{
// When node value is Even
}
else
{
// When node value is Odd
}
}
}
static func main()
{
let sll: SingleLL = SingleLL();
let odd: SingleLL = SingleLL();
let even: SingleLL = SingleLL();
// 4 → 3 → 5 → 2 → 11 → 1 → 6 → NULL
sll.insert(4);
sll.insert(3);
sll.insert(5);
sll.insert(2);
sll.insert(11);
sll.insert(1);
sll.insert(6);
print("Initial Element");
// Display all node
sll.display();
sll.segregateNode(odd, even);
print("\nEven Element");
// Display all even node
even.display();
print("\nOdd Element");
// Display all odd node
odd.display();
}
}
SingleLL.main();``````

Output

``````Initial Element
4   3   5   2   11   1   6
Even Element
2   4   6
Odd Element
1   3   5   11``````

## Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.