📘
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. Where to go next

The Fourier transform

Furye transformatsiyasi - bu noyob algoritmlardan biri: ajoyib, oqlangan va millionlab foydalanish holatlari bilan. Furye transformatsiyasi uchun eng yaxshi oʻxshashlik Better Explained (matematikani oddiygina tushuntirib beradigan ajoyib veb-sayt) dan olingan: smeti berilganda, Furye transformatsiyasi sizga smeti tarkibidagi ingredientlarni aytib beradi.1 Yoki boshqacha qilib aytganda, qoʻshiq berilganda, transformatsiya uni alohida chastotalarga ajratishi mumkin.

Ma'lum bo'lishicha, bu oddiy g'oya juda ko'p foydalanish holatlariga ega. Misol uchun, agar siz qo'shiqni chastotalarga ajrata olsangiz, o'zingizga qiziq bo'lganlarni kuchaytirishingiz mumkin. Bassni kuchaytirishingiz va treblni yashirishingiz mumkin. Furye transformatsiyasi signallarni qayta ishlash uchun juda yaxshi. Bundan tashqari, musiqani siqish uchun ham foydalanishingiz mumkin. Avval siz audio faylni uning tarkibiy qismlariga ajratasiz. Furye konvertatsiyasi har bir nota umumiy qo'shiqqa qanchalik hissa qo'shishini aniq aytadi. Shunday qilib, siz faqat muhim bo'lmagan eslatmalardan xalos bo'lishingiz mumkin. MP3 formati shunday ishlaydi!

Musiqa raqamli signalning yagona turi emas. JPG formati boshqa siqilgan format bo'lib, u xuddi shunday ishlaydi. Odamlar yaqinlashib kelayotgan zilzilalarni bashorat qilish va DNKni tahlil qilish uchun Furye transformatsiyasidan foydalanadilar.

Siz undan Shazam kabi ilovani yaratish uchun foydalanishingiz mumkin, u qaysi qo'shiq chalinayotganini taxmin qiladi. Furye konvertatsiyasi juda ko'p qo'llaniladi. Bunga duch kelish ehtimoli yuqori!

PreviousInverted indexesNextParallel algorithms

Last updated 1 year ago

Was this helpful?