Code is clean if it can be understood easily – by everyone on the team. Clean code can be read and enhanced by a developer other than its original author. With understandability comes readability, changeability, extensibility and maintainability.
| import java.util.Arrays; | |
| /** | |
| * quickselect is a selection algorithm to find the kth smallest element in an | |
| * unordered list. Like quicksort, it is efficient in practice and has good | |
| * average-case performance, but has poor worst-case performance. Quickselect | |
| * and variants is the selection algorithm most often used in efficient | |
| * real-world implementations. | |
| * | |
| * Quickselect uses the same overall approach as quicksort, choosing one |
| import random | |
| class TicTacToe: | |
| def __init__(self, playerX, playerO): | |
| self.board = [' ']*9 | |
| self.playerX, self.playerO = playerX, playerO | |
| self.playerX_turn = random.choice([True, False]) | |
| def play_game(self): |
| Below are the Big O performance of common functions of different Java Collections. | |
| List | Add | Remove | Get | Contains | Next | Data Structure | |
| ---------------------|------|--------|------|----------|------|--------------- | |
| ArrayList | O(1) | O(n) | O(1) | O(n) | O(1) | Array | |
| LinkedList | O(1) | O(1) | O(n) | O(n) | O(1) | Linked List | |
| CopyOnWriteArrayList | O(n) | O(n) | O(1) | O(n) | O(1) | Array |
| using UnityEngine; | |
| using System.Collections; | |
| using System.Collections.Generic; | |
| public static class AStar { | |
| // A* pathfinding | |
| /// <summary> | |
| /// Returns estimated cost of moving from point A to point B. |
| /* MULTIPLIES A and B ============= | |
| using Strassen's O(n^2.81) method | |
| A = [1 3] B = [6 8] | |
| [7 5] [4 2] | |
| C = A * B = ? | |
| =================================*/ | |
| // Step 1: Split A and B into half-sized matrices of size 1x1 (scalars). |
