GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — algorithm/recursion/stackSort.py at python · itsvinayak/algorithm Expand file tree/ Copy pathstackSort.pyMore file actions 53 lines (40 loc) · 991 Bytes / Copy pathstackSort.pyFile metadata and controls53 lines (40 loc) · 991 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 class Stack: def __init__(self): self.stack = [] def push(self, element): self.stack.append(element) def pop(self): return self.stack.pop() def isEmpty(self): return len(self.stack) == 0 def top(self): return self.stack[-1] def __str__(self): return f" stack is {self.stack}" def insert(self, element): if self.isEmpty or self.top() <= element: self.push(element) return temp = self.pop() print(temp, " ", element) self.insert(element) self.push(temp) def sort(self): if len(self.stack) == 1: return temp = self.pop() self.sort() self.insert(temp) def main(): s = Stack() s.push(2) s.push(1) s.push(0) s.push(2) s.push(8) s.push(2) print(s) s.sort() print(s) if __name__ == "__main__": main() |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |