## Append to a file

0 likes • Jun 1, 2023 • 0 views
Python

## More Python Posts

0 likes • Nov 19, 2022 • 1 view
Python
```# Python program for implementation of Radix Sort	# A function to do counting sort of arr[] according to# the digit represented by exp.def countingSort(arr, exp1):		n = len(arr)		# The output array elements that will have sorted arr	output =  * (n)		# initialize count array as 0	count =  * (10)		# Store count of occurrences in count[]	for i in range(0, n):		index = (arr[i]/exp1)		count[int((index)%10)] += 1		# Change count[i] so that count[i] now contains actual	# position of this digit in output array	for i in range(1,10):		count[i] += count[i-1]		# Build the output array	i = n-1	while i>=0:		index = (arr[i]/exp1)		output[ count[ int((index)%10) ] - 1] = arr[i]		count[int((index)%10)] -= 1		i -= 1		# Copying the output array to arr[],	# so that arr now contains sorted numbers	i = 0	for i in range(0,len(arr)):		arr[i] = output[i]
# Find the maximum number to know number of digits	max1 = max(arr)
# Do counting sort for every digit. Note that instead	# of passing digit number, exp is passed. exp is 10^i	# where i is current digit number	exp = 1	while max1/exp > 0:		countingSort(arr,exp)		exp *= 10
# Driver code to test abovearr = [ 170, 45, 75, 90, 802, 24, 2, 66]radixSort(arr)
for i in range(len(arr)):	print(arr[i]),```

#### Sort a List of Strings

0 likes • Oct 15, 2022 • 2 views
Python
```my_list = ["blue", "red", "green"]
#1- Using sort or srted directly or with specifc keysmy_list.sort() #sorts alphabetically or in an ascending order for numeric data my_list = sorted(my_list, key=len) #sorts the list based on the length of the strings from shortest to longest. # You can use reverse=True to flip the order
#2- Using locale and functools import localefrom functools import cmp_to_keymy_list = sorted(my_list, key=cmp_to_key(locale.strcoll))```

#### Shuffle Deck of Cards

0 likes • May 31, 2023 • 0 views
Python
```import random
# Define the ranks, suits, and create a deckranks = ['Ace', '2', '3', '4', '5', '6', '7', '8', '9', '10', 'Jack', 'Queen', 'King']suits = ['Hearts', 'Diamonds', 'Clubs', 'Spades']deck = [(rank, suit) for rank in ranks for suit in suits]
# Shuffle the deckrandom.shuffle(deck)
# Display the shuffled deckfor card in deck:    print(card, "of", card)```

#### Query UNT ActiveStudents

0 likes • Nov 18, 2022 • 1 view
Python
```import osimport sysimport argparseimport jsonimport csvimport getpassimport stringimport randomimport re
from datetime import datetimeimport ldapimport requestsfrom requests.packages.urllib3.exceptions import InsecureRequestWarningrequests.packages.urllib3.disable_warnings(InsecureRequestWarning)from requests.auth import HTTPBasicAuthimport validators
import ipdb
# ldap functionsdef get_ldap_group_members(ldap_group, user, passwrd, DOMAIN, DOMAIN_SEARCH_BASE):    #DOMAIN_GROUP, DOMAIN_USER, DOMAIN_PASS, DOMAIN, DOMAIN_SEARCH_BASE    '''    Input a user name and search the directory    '''    #---- Setting up the Connection    #account used for binding - Avoid putting these in version control    bindDN = str(user)    bindPass = passwrd
#set some tuneables for the LDAP library.    ldap.set_option(ldap.OPT_X_TLS_REQUIRE_CERT, ldap.OPT_X_TLS_ALLOW)    #ldap.set_option(ldap.OPT_X_TLS_CACERTFILE, CACERTFILE)        conn = ldap.initialize('ldaps://'+str(DOMAIN))    conn.protocol_version = 3    conn.set_option(ldap.OPT_REFERRALS, 0)
#authenticate the connection so that you can make additional queries    try:        result = conn.simple_bind_s(bindDN, bindPass)     except ldap.INVALID_CREDENTIALS:        result = "Invalid credentials for %s" % user        sys.exit()
#build query in the form of (uid=user)    ldap_query = '(cn=' + ldap_group + ')'
query_result = []      lencount = True    range_start = 0    total_active_students_count = 0        while lencount:        #print(len(query_result))        range_end = range_start + 1499        member_range = ['member;range=' + str(range_start) + '-' + str(range_end)]        #print(member_range)        ldap_info = conn.search_s(str(DOMAIN_SEARCH_BASE), ldap.SCOPE_SUBTREE, filterstr=ldap_query, attrlist=member_range)        member_range = next(iter(ldap_info.keys()))        ldap_objects = ldap_info[member_range]        print("\n")        for ldap_object in ldap_objects:            decoded_member_string = ldap_object.decode("utf-8")            member_cn = re.split('=|,', decoded_member_string)            print(f"User number: {total_active_students_count} in {ldap_group}: {member_cn}")            query_result.append(member_cn)            total_active_students_count = total_active_students_count + 1                if len(ldap_objects) == 1500:            lencount = True            range_start += 1500            range_end += 1500                else:            lencount = False            print(f"TOTAL USERS IN ActiveStudents: {total_active_students_count}")    return query_result

if __name__ == "__main__":    main()```

#### Topological sort

0 likes • Nov 19, 2022 • 0 views
Python
`#Python program to print topological sorting of a DAGfrom collections import defaultdict  #Class to represent a graphclass Graph:    def __init__(self,vertices):        self.graph = defaultdict(list) #dictionary containing adjacency List        self.V = vertices #No. of vertices      # function to add an edge to graph    def addEdge(self,u,v):        self.graph[u].append(v)      # A recursive function used by topologicalSort    def topologicalSortUtil(self,v,visited,stack):          # Mark the current node as visited.        visited[v] = True          # Recur for all the vertices adjacent to this vertex        for i in self.graph[v]:            if visited[i] == False:                self.topologicalSortUtil(i,visited,stack)          # Push current vertex to stack which stores result        stack.insert(0,v)      # The function to do Topological Sort. It uses recursive     # topologicalSortUtil()    def topologicalSort(self):        # Mark all the vertices as not visited        visited = [False]*self.V        stack =[]          # Call the recursive helper function to store Topological        # Sort starting from all vertices one by one        for i in range(self.V):            if visited[i] == False:                self.topologicalSortUtil(i,visited,stack)          # Print contents of stack        print(stack)  g= Graph(6)g.addEdge(5, 2);g.addEdge(5, 0);g.addEdge(4, 0);g.addEdge(4, 1);g.addEdge(2, 3);g.addEdge(3, 1);  print("Following is a Topological Sort of the given graph")g.topologicalSort()`

#### AnyTree Randomizer

0 likes • Apr 15, 2021 • 0 views
Python
```import anytree as atimport random as rm
# Generate a tree with node_count many nodes. Each has a number key that shows when it was made and a randomly selected color, red or white.def random_tree(node_count):        # Generates the list of nodes    nodes = []    for i in range(node_count):        test = rm.randint(1,2)        if test == 1:            nodes.append(at.Node(str(i),color="white"))        else:            nodes.append(at.Node(str(i),color="red"))        #Creates the various main branches    for i in range(node_count):        for j in range(i, len(nodes)):            test = rm.randint(1,len(nodes))            if test == 1 and nodes[j].parent == None and (not nodes[i] == nodes[j]):                nodes[j].parent = nodes[i]        #Collects all the main branches into a single tree with the first node being the root    for i in range(1, node_count):        if nodes[i].parent == None and (not nodes[i] == nodes):            nodes[i].parent = nodes
return nodes```