📘
Grokking-Algorithms book
PostgreSQL
  • Content
  • Introduction to Algorithms
    • Introduction
    • Binary Search
    • Big O notation
    • Recap
  • Selection sort
    • How memory works
    • Arrays and linked lists
    • Selection sort
    • Recap
  • Recursion
    • Recursion
    • Base case and recursive case
    • The stack
    • Recap
  • Quicksort
    • Divide & conquer
    • Quicksort
    • Big O notation revisited
    • Recap
  • Hash tables
    • Hash functions
    • Use cases
    • Collisions
    • Performance
    • Recap
  • Breadth-first search
    • Introduction to graph
    • What is a graph
    • Breadth-first search
    • Implementing the graph
    • Implementing the algorithm
    • Recap
  • Dijkstra's algorithm
    • Working with Dijkstra's algorithm
    • Terminology
    • Trading for a piano
    • Negative-weight edges
    • Implementation
    • Recap
  • Greedy Algorithms
    • The classroom scheduling problem
    • The knapsack problem
    • The set-covering problem
    • NP-complete problems
    • Traveling salesperson, step by step
    • Recap
  • Dynamic programming
    • The knapsack problem
    • Knapsack problem FAQ
    • Longest common substring
    • Recap
  • K-nearest neighbors
    • Classifying oranges vs. grapefruit
    • Building a recommendations system
    • Introduction to machine learning
    • Recap
  • Where to go next
    • Trees
    • Inverted indexes
    • The Fourier transform
    • Parallel algorithms
    • MapReduce
    • Bloom filters and HyperLogLog
    • The SHA algorithms
    • Locality-sensitive hashing
    • Diffie-Hellman key exchange
    • Linear programming
    • Epilogue
  • Answers to exercises
    • Chapter 1
    • Chapter 2
    • Chapter 3
    • Chapter 4
    • Chapter 5
    • Chapter 6
    • Chapter 7
    • Chapter 8
    • Chapter 9
    • Chapter 10
Powered by GitBook
On this page

Was this helpful?

Edit on GitHub
  1. Selection sort

How memory works

PreviousSelection sortNextArrays and linked lists

Last updated 1 year ago

Was this helpful?

Tasavvur qiling-a, siz tomoshaga borasiz va narsalaringizni tekshirishingiz kerak. Sandiq mavjud.

Har bir tortma bitta elementni ushlab turishi mumkin. Siz ikkita narsani saqlamoqchisiz, shuning uchun ikkita tortma so'raysiz.

Ikki narsangizni shu yerda saqlaysiz

Va siz namoyishga tayyorsiz! Bu, asosan, kompyuteringiz xotirasi qanday ishlaydi. Sizning kompyuteringiz ulkan tortma to'plamiga o'xshaydi va har bir tortmada manzil mavjud.

fe0ffeeb - xotiradagi uyaning manzili. Har safar ob'ektni xotirada saqlamoqchi bo'lganingizda, siz kompyuterdan biroz joy so'raysiz va u sizga elementingizni saqlashingiz mumkin bo'lgan manzilni beradi. Agar siz bir nechta elementlarni saqlamoqchi bo'lsangiz, buni amalga oshirishning ikkita asosiy usuli mavjud: massivlar va ro'yxatlar(Array and Lists). Men massivlar va ro'yxatlar haqida, shuningdek, har birining ijobiy va salbiy tomonlari haqida gapiraman. Har bir foydalanish holati uchun narsalarni saqlashning bitta to'g'ri usuli yo'q, shuning uchun farqlarni bilish muhimdir.

Shelf
Discuss
Two things
Address