I'm learning sorting algorithms and wrote my own implementation of Insertion Sort. Is it optimal? Is there anything that can be done better?
#include <iostream>
#include <vector>
#include <algorithm>
#include <vector>
void display(std::vector<int> arr)
{
for (int i = 0; i < arr.size(); ++i)
...
The previous question was not clear enough so I will try to clarify it more in this follow-up question.
I tried the multiple pointers technique to solve the problem that find pair of values that sums up to a target value.
We are assuming that:
the array is already sorted.
we are working with a ...
I trying to do generic repository and I cant make the update function work as I want.
I have 2 classes:
Aclass:
Id,Name,Virtual Collection of BClass
BClass:
Id,Name,Virtual Reference of Aclass
In my update function I get T of Aclass that contain list of Bclass the code is like this:
public vo...
I am using psycopg2 & sqlalchemy to connect to a database and extract information from a table as follows:
def db_connection():
eng = db.create_engine('my_URI')
conn = eng.connect()
return eng, conn
def table_conn():
engine, connection = db_connection()
metadata =...
from itertools import permutations
def next_bigger(n):
nlist = list(str(n))
perm = permutations(nlist,len(str(n)))
perm = set(perm)
listofperm = []
nlist = int("".join(nlist))
for x in perm:
form = int("".join(x))
if form < nlist:
continue
...
I've been teaching myself python and decided to make a Tic Tac Toe game for a bit of practice. Any criticisms or pointers are welcome! Thanks.
class TicTacToe:
"""A class for playing tic tac toe"""
def __init__(self):
self.values = ["-", "-", "-",
"-", "-", "-",
...
The Problem
I am trying to determine numerically how many possible ways a number of books can be arranged on a shelf. Specifically, there are x3 categories "physics", "sci-fi", and "travel". Each contains N_phys, N_scifi, and N_travel numbers of books respectively. Within their category, the book...
