derka6391

Guess a CSS property (Vue)

Guess a CSS property game made with Vue 2.

Idea, as well as alphabet and words from http://codepen.io/mburakerman/pen/eBerPG

A Pen by Goran Petričević on CodePen.

License.

derka6391

<script src="https://cdn.jsdelivr.net/npm/vue/dist/vue.min.js"></script>
<script src="https://cdn.jsdelivr.net/npm/highcharts@6/highmaps.js"></script>
<script src="https://code.highcharts.com/mapdata/custom/europe.js"></script>
<!-- vue-highcharts should be load after Highmaps -->
<script src="https://cdn.jsdelivr.net/npm/vue-highcharts/dist/vue-highcharts.min.js"></script>

<div id="app">
  <highmaps :options="options"></highmaps>
</div>

derka6391

class ArrayList:
    def __init__(self, initial_allocation_size = 10):
        self.allocation_size = allocation_size
        self.length = 0
        self.array = [None] * initial_allocation_size

derka6391

def insertion_sort_singly_linked(self):
    before_current = self.head
    current_node = self.head.next
    while current_node != None:
        next_node = current_node.next
        position = self.find_insertion_position(current_node.data)
        if position == before_current:
            before_current = current_node
        else:
            self.remove_after(before_current)

derka6391

def insertion_sort_doubly_linked(self):
    current_node = self.head.next
    while current_node != None:
        next_node = current_node.next
        search_node = current_node.prev
         
        while ((search_node != None) and 
               (search_node.data > current_node.data)):
            search_node = search_node.prev
      

derka6391

ListTraverseReverse(list) {
   curNode = list->tail // Start at tail

   while (curNode is not null) { 
      Print curNode's data        
      curNode = curNode->prev
   }
}

derka6391

ListTraverse(list) {
   curNode = list->head // Start at head

   while (curNode is not null) { 
      Print curNode's data        
      curNode = curNode->next
   }
}

derka6391

def remove(self, current_node):
    successor_node = current_node.next
    predecessor_node = current_node.prev

    if successor_node is not None:
        successor_node.prev = predecessor_node

    if predecessor_node is not None:
        predecessor_node.next = successor_node

derka6391

def insert_after(self, current_node, new_node):
    if self.head is None:
        self.head = new_node
        self.tail = new_node
    elif current_node is self.tail:
        self.tail.next = new_node
        new_node.prev = self.tail
        self.tail = new_node
    else:
        successor_node = current_node.next

derka6391

def prepend(self, new_node):
   if self.head == None:
      self.head = new_node
      self.tail = new_node
   else:
      new_node.next = self.head
      self.head.prev = new_node
      self.head = new_node