PJUllrich

Big-O Time Complexities for Elixir data structures

Map [1]

Operation	Time Complexity
Access	O(log n)
Search	O(log n)
Insertion	O(n) for <= 32 elements, O(log n) for > 32 elements [2]
Deletion	O(n) for <= 32 elements, O(log n) for > 32 elements

davialexandre

{
  "background" : "#282828",
  "black" : "#282828",
  "blue" : "#458588",
  "brightBlack" : "#928374",
  "brightBlue" : "#83A598",
  "brightCyan" : "#8EC07C",
  "brightGreen" : "#B8BB26",
  "brightPurple" : "#D3869B",
  "brightRed" : "#FB4934",

bradtraversy

GENERATORS:

• Text Content Generator - http://www.lipsum.com
• Favicon Generator - http://tools.dynamicdrive.com/favicon
• Data Generator - https://mockaroo.com/
• Mobile Mockup Generator - https://mockuphone.com
• Logo Generator - https://www.logaster.com
• UUID Generator - https://www.uuidgenerator.net/
• Hash Generator - https://passwordsgenerator.net/sha256-hash-generator/
• Ultimate Code Generator - https://webcode.tools/

bcole808

<?php
/**
 * Sort a multi-domensional array of objects by key value
 * Usage: usort($array, arrSortObjsByKey('VALUE_TO_SORT_BY'));
 * Expects an array of objects. 
 *
 * @param String    $key  The name of the parameter to sort by
 * @param String 	$order the sort order
 * @return A function to compare using usort
 */