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

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.

Kick starting with Raspberry Pi

To start any machine first it has to be assembled. Though this is a very old, simple and well answered/documented question but still it’s being asked so many times that I have decided to write a post. There are 2 versions that we can get running:- 1. Using NOOBS (New Out Of the Box Software) 2. Using Raspbian Noobs essentially contains Raspbian with same selection menu. Raspbian can be installed with NOOBS or downloaded as a separate image (.img file) and then burnt onto an SD card. Raspbian comes pre-installed with plenty of software for education, programming and general use. It has Python, Scratch, Sonic Pi, Java, Mathematica and more. General steps to perform for NOOBS:- 1. Download NOOBS.zip from here . 2. Use SD Card formatter to quick format the SD card. 3. Copy the contents of ZIP file to the SD Card. 4. Now you can directly use this SD card into your RPi. General steps to perform for Raspbian:- 1. Download Raspbian Jessie .zip. The zip file he

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 Post Order Traversal

meld 'n' weld

Search This Blog