Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Dancing with Python
  • Table Of Contents Toc
  • Feedback & Rating feedback
Dancing with Python

Dancing with Python

By : Robert S. Sutor
5 (7)
close
close
Dancing with Python

Dancing with Python

5 (7)
By: Robert S. Sutor

Overview of this book

Dancing with Python helps you learn Python and quantum computing in a practical way. It will help you explore how to work with numbers, strings, collections, iterators, and files. The book goes beyond functions and classes and teaches you to use Python and Qiskit to create gates and circuits for classical and quantum computing. Learn how quantum extends traditional techniques using the Grover Search Algorithm and the code that implements it. Dive into some advanced and widely used applications of Python and revisit strings with more sophisticated tools, such as regular expressions and basic natural language processing (NLP). The final chapters introduce you to data analysis, visualizations, and supervised and unsupervised machine learning. By the end of the book, you will be proficient in programming the latest and most powerful quantum computers, the Pythonic way.
Table of Contents (29 chapters)
close
close
2
Part I: Getting to Know Python
10
PART II: Algorithms and Circuits
14
PART III: Advanced Features and Libraries
19
References
20
Other Books You May Enjoy
1
Appendices
4
Appendix C: The Complete UniPoly Class
5
Appendix D: The Complete Guitar Class Hierarchy
7
Appendix F: Production Notes

3.3 The joy of O(1)

How long should it take for len to compute the length of the list? One way is to iterate through the list:

  1. Initialize a counter to 0.
  2. If the list is not empty, go to the first item and add one to the counter. Otherwise, return the value of the counter, which is 0.
  3. Try going to the next item. If it is not present, we have reached the end and return the counter. Otherwise, go to the item and increment the counter.
  4. Go back to the previous step and repeat until we are finished.

There is a computing time overhead in moving from item to item and incrementing the counter. Let’s call this C. If our list has n items, then

time to compute the length by this method ≤ C × n.

If your computer is faster than mine, your C might be smaller. C also depends on the implementation of lists and Python itself.

This algorithm is O(n): its time is proportional...

Visually different images
CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Dancing with Python
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon