Looping in a spiral

by

Here’s my solution (in Python):

def spiral(X, Y):
    x = y = 0
    dx = 0
    dy = -1
    for i in range(max(X, Y)**2):
        if (-X/2 < x <= X/2) and (-Y/2 < y <= Y/2):
            print (x, y)
            # DO STUFF...
        if x == y or (x < 0 and x == -y) or (x > 0 and x == 1-y):
            dx, dy = -dy, dx
        x, y = x+dx, y+dy

More Related Contents:

  1. How do you rotate a two dimensional array?
  2. How to determine if a linked list has a cycle using only two memory locations
  3. A Cache Efficient Matrix Transpose Program?
  4. Print 2-D Array in clockwise expanding spiral from center
  5. Search a sorted 2D matrix [duplicate]
  6. Draw equidistant points on a spiral
  7. Finding connected components of adjacency matrix graph
  8. Algorithm to beat Strassen’s Algorithm
  9. What does O(log n) mean exactly?
  10. What exactly does big Ө notation represent?
  11. Is there an efficient way to generate N random integers in a range that have a given sum or average?
  12. Why is quicksort better than mergesort?
  13. Which sort algorithm works best on mostly sorted data? [closed]
  14. Pseudorandom Number Generator – Exponential Distribution
  15. Natural Sorting algorithm
  16. How to delete in a heap data structure?
  17. How can I detect common substrings in a list of strings
  18. What are the practical factors to consider when choosing between Depth-First Search (DFS) and Breadth-First Search (BFS)? [closed]
  19. Efficiently reverse the order of the words (not characters) in an array of characters
  20. Scheduling algorithm for a round-robin tournament?
  21. Painter puzzle – estimation
  22. Approximate string matching algorithms
  23. Skip List vs. Binary Search Tree
  24. Previous power of 2
  25. Fast solution to Subset sum
  26. Generating shuffled range using a PRNG rather than shuffling
  27. Find out which combinations of numbers in a set add up to a given total
  28. Print the biggest K elements in a given heap in O(K*log(K))?
  29. Optimized low-accuracy approximation to `rootn(x, n)`
  30. What are probabilistic data structures?

Leave a Comment