Ong Wai Hong whong92

## jane-street-nov.ipynb

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                whong92
                / jane-street-nov.ipynb
            
            
              Last active
              November 26, 2024 22:06
            
          
      Loading

      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## GraphColoring.py
from pprint import pprint
from collections import defaultdict
import numpy as np
from typing import List

class Node:
    """[
        Object representing a node in the hypercube graph
        Has a binary coordinate b and a color c
    ]

## timestampSim.py
import numpy as np

class node:
    """
    Node class to model the events as nodes in a graph.
    Have parent and child pointers, a node id (unique integer) and a process id
    Has a timestamp (ts) attribute which can be set by the BFS
    """
    def __init__(self):
        self.id = None

## simpleChord.py
from pprint import pprint

def binarySearch(alist, item):
    """
    binary search given alist and item to search for
    returns is element was found, otherwise return the last midpoint before search failed
    last midpoint is always either the predessecor or succesor to item (if the item is not found)
    """
    first = 0
    last = len(alist)-1
	from pprint import pprint
	from collections import defaultdict
	import numpy as np
	from typing import List

	class Node:
	"""[
	Object representing a node in the hypercube graph
	Has a binary coordinate b and a color c
	]
	import numpy as np

	class node:
	"""
	Node class to model the events as nodes in a graph.
	Have parent and child pointers, a node id (unique integer) and a process id
	Has a timestamp (ts) attribute which can be set by the BFS
	"""
	def __init__(self):
	self.id = None
	from pprint import pprint

	def binarySearch(alist, item):
	"""
	binary search given alist and item to search for
	returns is element was found, otherwise return the last midpoint before search failed
	last midpoint is always either the predessecor or succesor to item (if the item is not found)
	"""
	first = 0
	last = len(alist)-1