02 2022 档案
摘要：int Util::partition9(int *arr, int low, int high) { int pivot = *(arr + high); int i = low - 1; for (int j = low; j < high; j++) { if (arr[j] < pivot)
阅读全文
摘要：void Util::getArray(int *arr,int len) { srand(time(NULL)); for(int i=0;i<len;i++) { *(arr+i)=rand(); } } void Util::printArray(int *arr,int len) { for
阅读全文
摘要：//Node.cpp #include <iostream> using namespace std; template<typename T> class Node { public: T Val; Node<T> *Next; Node(T value):Val(value){}; }; //h
阅读全文
摘要：// The MIT License (MIT) // Copyright (c) 2022 SmoothTech // Permission is hereby granted, free of charge, to any person obtaining a // copy of this s
阅读全文
摘要：#include <iostream> #include <iterator> using namespace std; void arrayPointer3(); int main() { arrayPointer3(); return 0; } void arrayPointer3() { in
阅读全文
摘要：#include <iostream> #include <ctime> #include <uuid/uuid.h> #include <unistd.h> #include <string.h> #include <random> #include <fstream> #include <ost
阅读全文
摘要：#include <iostream> #include <ctime> #include <uuid/uuid.h> #include <unistd.h> #include "Model/BookStruct.cpp" #include <string.h> #include <typeinfo
阅读全文
摘要：#include <iostream> using namespace std; void fileExist11(); void fileExist12(); int main() { fileExist12(); return 0; } void fileExist12() { string f
阅读全文
