Skip to main content

Appian function merge()

Lets have a look at merge() function.

It takes a number of list and combines them to create a new list. Takes an element sequentially from each list and append it to the major list.
Below are some of the examples.

merge({10, 50}, {60, 40})
Value  10; 60; 50; 40


merge({10, 30}, {20, 40, 50})
Value  10; 20; 30; 40; ; 50


merge({10, 30}, {20, 40, 50}, {60})
Value  10; 20; 60; 30; 40; ; ; 50;   #After the last semicolon one elelent exist 


merge({10, 30}, {20, 40, 50}, {60,70,80})
Value  10; 20; 60; 30; 40; 70; ; 50; 80


merge({1, 2, 3}, {4, 5, 6}) returns 1, 4, 2, 5, 3, 6


Source
Labels:

Comments

Post a Comment

Popular posts from this blog

Swapping of variables

There are a couple of classical ways to do it. Let the variables be:- a = 5 b = 10 1. By using temporary variable "temp" (name as per your convenience). temp = a a = b b = temp 2. Without "temp" or any extra variable a = a + b   // 15 b = a - b   // b becomes 5 a = a - b   // a becomes 10 3. In Python like a Boss!! :D a, b = b, a
Post a Comment
Read more

Simple Queue Implementation using Python

Stacks and Queues are not data structures, they are basically abstract data types. The simple data structure can be an array or a linked list. Queues are FIFO.. First In and First Out. Queues do have real world operations like:- 1.    Token System 2.    Organising data to archive based on age. 3.    Scheduling 4.    Any task which involves first come first serve basis. Below is a simple implementation of Queue using Python. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 class Queue : def __init__ ( self ): self . queue = [] def isEmpty ( self ): return self . queue == [] def enqueue ( self , data): self . queue . append(data) def dequeue ( self ): data = self . queue[ 0 ] del self . queue[ 0 ] return data def peek ( self ): return se...
Post a Comment
Read more