Standard algorithms

Standard Level

  • Print all items in an array
  • Find the max/min value in an array
  • Finding the index of a particular value in an array
  • Inserting a value in an array
  • Removing a value from an array
  • Sorting an array using bubblesort
  • Sorting an array using selectionsort

Higher Level

  • Binary search of an array
  • Stack.push()
  • Stack.pop()
  • Queue.enqueue()
  • Queue.dequeue()
  • Adding a node to a linked list
  • Removing a node from a linked list
  • Adding a node to a binary tree
  • Removing a node from a binary tree
  • Preorder, Inorder and Postorder binary tree traversals

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s