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

Comments

Popular posts from this blog

Solution Python QnA #1

Solution for Python QnA for November 14, 2018. # OUTPUT****************************************** >>> x = input () 12 >>> y = int ( input ( 'Please enter a number' )) Please enter a number45 >>> x + y Traceback (most recent call last): File "<stdin>" , line 1 , in < module > TypeError : must be str , not int >>> y + y 90 >>> x + x '1212' In this (x+y); addition of integer and string is not allowed. hence we get the TypeError.

Picking the structure!!

Use of arrays, rather sorted arrays or a linked list is somewhat difficult because both have their pros and cons.  Arrays excel when we have to perform a binary search while it’s faster to add and remove elements from linked lists.  A tree is one structure where there is ONLY ONE path to reach to a node. This can be explained further as “Nodes cannot be in closed loop” . Also there is a hierarchical relationship of parent and child. The average complexity varies from logarithmic to linear time. Now coming further to a data structure BSTs aka Binary Search Trees . Points to be remembered here:- Maximum two children. Left child is smaller than parent. Right one is greater than parent. Traversals :-   In order Traversal Ascending Sort; left subtree + root+ right subtree. So the above tree will look like:  4, 12, 16, 25, 28, 32 Pre order Traversal Root + left subtree + right subtree recursively. Eg: 25, 12, 4, 16, 32, 28 Po...

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