Python3 Program to Rotate bits of a number Last Updated : 06 Sep, 2024 Comments Improve Suggest changes Like Article Like Report Bit Rotation: A rotation (or circular shift) is an operation similar to a shift except that the bits that fall off at one end are put back to the other end. In the left rotation, the bits that fall off at the left end are put back at the right end. In the right rotation, the bits that fall off at the right end are put back at the left end. INTRODUCTION:In this Python program, we will learn how to rotate the bits of a given number. Bit rotation, also known as bit shifting, is a technique for rotating the bits of a binary number to the left or right. This can be useful in a variety of contexts, such as in computer science and cryptography.The program will take an integer input and a rotation distance, and will output the resulting rotated number. The program will use bit shifting and bitwise OR operations to accomplish the rotation.We will begin by declaring the necessary variables and prompting the user for input. Next, we will use bit shifting and bitwise OR to rotate the bits of the input number according to the specified rotation distance. Finally, we will output the resulting rotated number to the console.EXAMPLE 1: Python def rotate_bits(num, rot): return (num << rot) & 0xFFFFFFFF num = int(input("Enter a number: ")) rot = int(input("Enter the number of positions to rotate: ")) result = rotate_bits(num, rot) print("The result of the rotation is:", result) Example: 2Let n is stored using 8 bits. Left rotation of n = 11100101 by 3 makes n = 00101111 (Left shifted by 3 and first 3 bits are put back in last ). If n is stored using 16 bits or 32 bits then left rotation of n (000...11100101) becomes 00..0011100101000. Right rotation of n = 11100101 by 3 makes n = 10111100 (Right shifted by 3 and last 3 bits are put back in first ) if n is stored using 8 bits. If n is stored using 16 bits or 32 bits then right rotation of n (000...11100101) by 3 becomes 101000..0011100. Python3 # Python3 code to # rotate bits of number INT_BITS = 32 # Function to left # rotate n by d bits def leftRotate(n, d): # In n<<d, last d bits are 0. # To put first 3 bits of n at # last, do bitwise or of n<<d # with n >>(INT_BITS - d) return (n << d)|(n >> (INT_BITS - d)) # Function to right # rotate n by d bits def rightRotate(n, d): # In n>>d, first d bits are 0. # To put last 3 bits of at # first, do bitwise or of n>>d # with n <<(INT_BITS - d) return (n >> d)|(n << (INT_BITS - d)) & 0xFFFFFFFF # Driver program to # test above functions n = 16 d = 2 print("Left Rotation of",n,"by" ,d,"is",end=" ") print(leftRotate(n, d)) print("Right Rotation of",n,"by" ,d,"is",end=" ") print(rightRotate(n, d)) # This code is contributed by # Smitha Dinesh Semwal Output : Left Rotation of 16 by 2 is 64Right Rotation of 16 by 2 is 4Time Complexity: O(1)Auxiliary Space: O(1)Please refer complete article on Rotate bits of a number for more details! Comment More infoAdvertise with us Next Article Python3 Program to Rotate bits of a number kartik Follow Improve Article Tags : Bit Magic Python Python Programs DSA rotation +1 More Practice Tags : Bit Magicpython Similar Reads Python Tutorial | Learn Python Programming Language Python Tutorial â Python is one of the most popular programming languages. Itâs simple to use, packed with features and supported by a wide range of libraries and frameworks. Its clean syntax makes it beginner-friendly.Python is:A high-level language, used in web development, data science, automatio 10 min read DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Python Interview Questions and Answers Python is the most used language in top companies such as Intel, IBM, NASA, Pixar, Netflix, Facebook, JP Morgan Chase, Spotify and many more because of its simplicity and powerful libraries. To crack their Online Assessment and Interview Rounds as a Python developer, we need to master important Pyth 15+ min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Python OOPs Concepts Object Oriented Programming is a fundamental concept in Python, empowering developers to build modular, maintainable, and scalable applications. By understanding the core OOP principles (classes, objects, inheritance, encapsulation, polymorphism, and abstraction), programmers can leverage the full p 11 min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Like